English
Related papers

Related papers: Generalized non-crossing Partitions and Buildings

200 papers

Non-crossing partitions have been a staple in combinatorics for quite some time. More recently, they have surfaced (sometimes unexpectedly) in various other contexts from free probability to classifying spaces of braid groups. Also,…

Group Theory · Mathematics 2019-03-05 Barbara Baumeister , Kai-Uwe Bux , Friedrich Götze , Dawid Kielak , Henning Krause

We present a categorification of the non-crossing partitions given by crystallographic Coxeter groups. This involves a category of certain bilinear lattices, which are essentially determined by a symmetrisable generalised Cartan matrix…

Representation Theory · Mathematics 2015-06-09 Andrew Hubery , Henning Krause

This article examines noncrossing partitions of the unit circle in the complex plane; we call these continuous noncrossing partitions. More precisely, we focus on the degree-$d$ continuous noncrossing partitions where unit complex numbers…

Group Theory · Mathematics 2025-07-02 Michael Dougherty , Jon McCammond

The lattice of noncrossing partitions is well-known for its wide variety of combinatorial appearances and properties. For example, the lattice is rank-symmetric and enumerated by the Catalan numbers. In this article, we introduce a large…

Combinatorics · Mathematics 2024-09-17 Stella Cohen , Michael Dougherty , Andrew D. Harsh , Spencer Park Martin

The noncrossing partition poset associated to a Coxeter group $W$ and Coxeter element $c$ is the interval $[1,c]_T$ in the absolute order on $W$. We construct a new model of noncrossing partititions for $W$ of classical affine type, using…

Combinatorics · Mathematics 2026-05-13 Laura G. Brestensky , Nathan Reading

For a finite real reflection group $W$ we use non-crossing partitions of type $W$ to construct finite cell complexes with the homotopy type of the Milnor fiber of the associated $W$-discriminant $\Delta_W$ and that of the Milnor fiber of…

Group Theory · Mathematics 2018-12-19 Thomas Brady , Michael Falk , Colum Watt

For each finite configuration of distinct points in the plane, there is an associated lattice of noncrossing partitions. When these points form the vertices of a convex polygon, the result is the classical noncrossing partition lattice,…

Combinatorics · Mathematics 2026-04-17 Michael Dougherty , Kaiyi Fang , Yunting Jiang , Edgar Lin , Lucas Lindenmuth , Eleanor Pokras , Gina Root

In this article we prove that the lattice of noncrossing partitions is EL-shellable when associated with the well-generated complex reflection group of type $G(d,d,n)$, for $d,n\geq 3$, or with the exceptional well-generated complex…

Combinatorics · Mathematics 2016-07-27 Henri Mühle

There are two natural simplicial complexes associated to the noncrossing partition lattice: the order complex of the full lattice and the order complex of the lattice with its bounding elements removed. The latter is a complex that we call…

Combinatorics · Mathematics 2017-07-21 Michael Dougherty , Jon McCammond

This memoir constitutes the author's PhD thesis at Cornell University. It serves both as an expository work and as a description of new research. At the heart of the memoir, we introduce and study a poset $NC^{(k)}(W)$ for each finite…

Combinatorics · Mathematics 2007-10-19 Drew Armstrong

We introduce Coxeter-sortable elements of a Coxeter group W. For finite W, we give bijective proofs that Coxeter-sortable elements are equinumerous with clusters and with noncrossing partitions. We characterize Coxeter-sortable elements in…

Combinatorics · Mathematics 2026-05-13 Nathan Reading

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

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

We examine the lattice of all order congruences of a finite poset from the viewpoint of combinatorial algebraic topology. We will prove that the order complex of the lattice of all nontrivial order congruences (or order-preserving…

Combinatorics · Mathematics 2016-12-30 Gejza Jenča , Peter Sarkoci

The lattice of intersections of reflecting hyperplanes of a complex reflection group W may be considered as the poset of 1-eigenspaces of the elements of W. In this paper we replace 1 with an arbitrary eigenvalue and study the topology and…

Combinatorics · Mathematics 2012-08-10 Alexander R. Miller

Let G be a complete Kac-Moody group of rank n \geq 2 over the finite field of order q, with Weyl group W and building \Delta. We first show that if W is right-angled, then for all q \neq 1 mod 4 the group G admits a cocompact lattice \Gamma…

Group Theory · Mathematics 2012-09-04 Inna Capdeboscq , Anne Thomas

The set of all subracks $\mathcal{R}(X)$ of a finite rack $X$ form a lattice under inclusion. We prove that if a rack $X$ satisfies a certain condition then the homotopy type of the order complex of $\mathcal{R}(X)$ is a $(m-2)$-sphere,…

Group Theory · Mathematics 2022-03-29 Selçuk Kayacan

We show that two uniform lattices of a regular right-angled Fuchsian building are commensurable, provided the chamber is a polygon with at least six edges. We show that in an arbitrary Gromov-hyperbolic regular right-angled building…

Group Theory · Mathematics 2009-04-20 Frederic Haglund

Certain mathematical structures make a habit of reoccuring in the most diverse list of settings. Some obvious examples exhibiting this intrusive type of behavior include the Fibonacci numbers, the Catalan numbers, the quaternions, and the…

Combinatorics · Mathematics 2007-05-23 Jon McCammond

The total number of noncrossing partitions of type $\Psi$ is the $n$th Catalan number $\frac{1}{n+1}\binom{2n}{n}$ when $\Psi=A_{n-1}$, and the binomial $\binom{2n}{n}$ when $\Psi=B_n$, and these numbers coincide with the correspondent…

Combinatorics · Mathematics 2011-11-14 Ricardo Mamede