Related papers: A categorification of non-crossing partitions

We classify t-structures and thick subcategories in discrete cluster categories $\mathcal{C}(\mathcal{Z})$ of Dynkin type $A$, and show that the set of all t-structures on $\mathcal{C}(\mathcal{Z})$ is a lattice under inclusion of aisles,…

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…

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…

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…

Introduced by Reading, the shard intersection order of a finite Coxeter group $W$ is a lattice structure on the elements of $W$ that contains the poset of noncrossing partitions $NC(W)$ as a sublattice. Building on work of Bancroft in the…

We introduce a new basis of the Temperley-Lieb algebra. It is defined using a bijection between noncrossing partitions and fully commutative elements together with a basis introduced by Zinno, which is obtained by mapping the simple…

We use the characteristic polynomial of the Coxeter matrix of an algebra to complete the combinatorial classification of piecewise hereditary algebras which Happel gave in terms of the trace of the Coxeter matrix. We also give a…

This paper generalizes in the affine symmetric group the notion of Coxeter sortable (or c-sortable for short) elements, as well as the classical bijection between c-sortable elements and c-noncrossing partitions defined by Reading in finite…

Higher-order notions of Kreweras complementation have appeared in the literature in the works of Krawczyk, Speicher, Mastnak, Nica, Arizmendi, Vargas, and others. While the theory has been developed primarily for specific applications in…

Let W be a finite crystallographic reflection group. The generalized Catalan number of W coincides both with the number of clusters in the cluster algebra associated to W, and with the number of noncrossing partitions for W. Natural…

In [17], we introduced ``picture groups'' and computed the cohomology of the picture group of type $A_n$. This is the same group what was introduced by Loday [20] where he called it the ``Stasheff group''. In this paper, we give an…

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…

Motivated by recent work on mixtures of classical and free probabilities, we introduce and study the notion of $\epsilon$-noncrossing partitions. It is shown that the set of such partitions forms a lattice, which interpolates as a poset…

We realize the crystal associated to the quantized enveloping algebras with a symmetric generalized Cartan matrix as a set of Lagrangian subvarieties of the cotangent bundle of the quiver variety. As a by-product, we give a counterexample…

We give a combinatorial model for the bounded derived category of graded modules over the dual numbers in terms of arcs on the integer line with a point at infinity. Using this model we describe the lattice of thick subcategories of the…

Following an idea of A. Berenstein, we define a commutor for the category of crystals of a finite dimensional complex reductive Lie algebra. We show that this endows the category of crystals with the structure of a coboundary category.…

When W is a finite reflection group, the noncrossing partition lattice NCP_W of type W is a rich combinatorial object, extending the notion of noncrossing partitions of an n-gon. A formula (for which the only known proofs are case-by-case)…

In 2007, D.I. Panyushev defined a remarkable map on the set of nonnesting partitions (antichains in the root poset of a finite Weyl group). In this paper we identify Panyushev's map with the Kreweras complement on the set of noncrossing…

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…

Let Q be a Dynkin quiver. The bounded derived category of the path algebra of Q has an autoequivalence given by the composition of the Auslander-Reiten translate and the square of the shift functor. We study maximal Hom-free sets in the…