Related papers: Noncrossing partitions, clusters and the Coxeter p…

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…

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…

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,…

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…

For any finite Coxeter group $W$ of rank $n$ we show that the order complex of the lattice of non-crossing partitions $\mathrm{NC}(W)$ embeds as a connected chamber subcomplex into a spherical building of type $A_{n-1}$. We use this to give…

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…

We prove that the restriction of Bruhat order to noncrossing partitions in type $A_n$ for the Coxeter element $c=s_1s_2 ...s_n$ forms a distributive lattice isomorphic to the order ideals of the root poset ordered by inclusion. Motivated by…

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…

Although both noncrossing partitions and nonnesting partitions are uniformly enumerated for Weyl groups, the exact relationship between these two sets of combinatorial objects remains frustratingly mysterious. In this paper, we give a…

We situate the noncrossing partitions associated to a finite Coxeter group within the context of the representation theory of quivers. We describe Reading's bijection between noncrossing partitions and clusters in this context, and show…

Let $\mathcal{L}$ be the noncrossing partition lattice associated to a finite Coxeter group $W$. In this paper we construct explicit bases for the top homology groups of intervals and rank-selected subposets of $\mathcal{L}$. We define a…

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…

We use the theory of hyperplane arrangements to construct natural bases for the homology of partition lattices of types A, B and D. This extends and explains the "splitting basis" for the homology of the partition lattice given in [Wa96],…

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…

We define a new lattice structure on the elements of a finite Coxeter group W. This lattice, called the shard intersection order, is weaker than the weak order and has the noncrossing partition lattice NC(W) as a sublattice. The new…

We study positive $m$-divisible non-crossing partitions and their positive Kreweras maps. In classical types, we describe their combinatorial realisations as certain non-crossing set partitions. We also realise these positive Kreweras maps…

Each finite configuration of points in the plane determines a corresponding lattice of noncrossing partitions. When these points form the vertex set of a convex polygon, the associated lattice is the classical noncrossing partition lattice…

We introduce and study the model of simply generated non-crossing partitions, which are, roughly speaking, chosen at random according to a sequence of weights. This framework encompasses the particular case of uniform non-crossing…

We introduce bijections between generalized type $A_n$ noncrossing partitions (that is, associated to arbitrary standard Coxeter elements) and fully commutative elements of the same type. The latter index the diagram basis of the classical…

We introduce two order relations on finite Coxeter groups which refine the absolute and the Bruhat order, and establish some of their main properties. In particular we study the restriction of these orders to noncrossing partitions and show…