English
Related papers

Related papers: Shellability of noncrossing partition lattices

200 papers

A group $G$ with conjugation operation is a rack. We call such racks \emph{group racks}. In this paper we study finite group racks via their subrack lattices. Heckenberger, Shareshian, and Welker proved that the isomorphism type of the…

Group Theory · Mathematics 2026-04-14 Selçuk Kayacan

We define and study noncommutative crossing partitions which are a generalization of non-crossing partitions. By introducing a new cover relation on binary trees, we show that the partially ordered set of noncommutative crossing partitions…

Combinatorics · Mathematics 2022-11-22 Keiichi Shigechi

For any finite, real reflection group $W$, we construct a geometric basis for the homology of the corresponding non-crossing partition lattice. We relate this to the basis for the homology of the corresponding intersection lattice…

Combinatorics · Mathematics 2008-07-15 Aisling Kenny

The present thesis studies structural properties of non-crossing partitions associated to finite Coxeter groups from both algebraic and geometric perspectives. On the one hand, non-crossing partitions are lattices, and on the other hand, we…

Combinatorics · Mathematics 2019-03-18 Julia Heller

We prove that for all $d \geq 1$ a shellable $d$-dimensional simplicial complex with at most $d+3$ vertices is extendably shellable. The proof involves considering the structure of `exposed' edges in chordal graphs as well as a connection…

Combinatorics · Mathematics 2021-02-25 Jared Culbertson , Anton Dochtermann , Dan P. Guralnik , Peter F. Stiller

We disprove a long-standing open conjecture due to Simon stating that all skeleta of simplices are extendably shellable. In particular, for every $d \geq 3$ we provide a pure $d$-dimensional shellable simplicial complex which is not…

Combinatorics · Mathematics 2026-05-26 Davide Bolognini , Paolo Sentinelli

We prove that every finite distributive lattice is isomorphic to a final segment of the d.c.e. Turing degrees (i.e., the degrees of differences of computably enumerable sets). As a corollary, we are able to infer the undecidability of the…

Logic · Mathematics 2024-03-22 Steffen Lempp , Yiqun Liu , Yong Liu , Keng Meng Ng , Cheng Peng , Guohua Wu

We establish several independent results concerning extremal, left modular, congruence uniform, and semidistributive lattices. An equivalent characterization of left modular lattices is obtained in terms of edge-labellings, together with…

Combinatorics · Mathematics 2025-12-01 Adrien Segovia

We construct an ungraded CL-shellable poset and a graded CL-shellable poset and show that neither is EL-shellable.

Combinatorics · Mathematics 2019-07-17 Tiansi Li

We prove that if a simplicial complex is shellable, then the intersection lattice for the corresponding diagonal arrangement is homotopy equivalent to a wedge of spheres. Furthermore, we describe precisely the spheres in the wedge, based on…

Combinatorics · Mathematics 2008-04-12 Sangwook Kim

We prove that the lattice of normal subgroups of ultraproducts of compact simple non-abelian groups is distributive. In the case of ultraproducts of finite simple groups or compact connected simple Lie groups of bounded rank the set of…

Group Theory · Mathematics 2014-02-26 Abel Stolz , Andreas Thom

For a fixed integer $k$, we consider the set of noncrossing partitions, where both the block sizes and the difference between adjacent elements in a block is $1\bmod k$. We show that these $k$-indivisible noncrossing partitions can be…

Combinatorics · Mathematics 2021-07-26 Henri Mühle , Philippe Nadeau , Nathan Williams

We prove that the second derived subdivision of any rectilinear triangulation of any convex polytope is shellable. Also, we prove that the first derived subdivision of every rectilinear triangulation of any convex 3-dimensional polytope is…

Combinatorics · Mathematics 2015-03-20 Karim Alexander Adiprasito , Bruno Benedetti

A set partition is said to be $(k,d)$-noncrossing if it avoids the pattern $12... k12... d$. We find an explicit formula for the ordinary generating function of the number of $(k,d)$-noncrossing partitions of $\{1,2,...,n\}$ when $d=1,2$.

Combinatorics · Mathematics 2008-08-11 Toufik Mansour , Simone Severini

The partition lattice and noncrossing partition lattice are well studied objects in combinatorics. Given a graph $G$ on vertex set $\{1,2,\dots, n\}$, its bond lattice, $L_G$, is the subposet of the partition lattice formed by restricting…

Combinatorics · Mathematics 2020-12-15 C. Matthew Farmer , Joshua Hallam , Clifford Smyth

In this note we show that the volume of axis-parallel boxes in $\mathbb{R}^d$ which do not intersect an admissible lattice $\mathbb{L}\subset\mathbb{R}^d$ is uniformly bounded. In particular, this implies that the dispersion of the dilated…

Computational Geometry · Computer Science 2021-08-16 Mario Ullrich

We discuss dense embeddings of surface groups and fully residually free groups in topological groups. We show that a compact topological group contains a nonabelian dense free group of finite rank if and only if it contains a dense surface…

Group Theory · Mathematics 2009-03-02 Emmanuel Breuillard , Tsachik Gelander , Juan Souto , Peter Storm

We investigate which higher rank simple Lie groups admit profinitely but not abstractly commensurable lattices. We show that no such examples exist for the complex forms of type $E_8$, $F_4$, and $G_2$. In contrast, there are arbitrarily…

Group Theory · Mathematics 2021-04-14 Holger Kammeyer , Steffen Kionke

The concept of a matroid quotient has connections to fundamental questions in the geometry of flag varieties. In previous work, Benedetti and Knauer characterized quotients in the class of lattice path matroids (LPMs) in terms of a simple…

Combinatorics · Mathematics 2025-04-11 Carolina Benedetti , Anton Dochtermann , Kolja Knauer , Yupeng Li

A partial lattice P is ideal-projective, with respect to a class C of lattices, if for every K $\in$ C and every homomorphism $\phi$ of partial lattices from P to the ideal lattice of K, there are arbitrarily large choice functions f : P…

Combinatorics · Mathematics 2016-12-14 Friedrich Wehrung