Related papers: Non-crossing partitions
Noncrossing arc diagrams are combinatorial models for permutations that encode information about lattice congruences of the weak order and about the associated discrete geometry. In this paper, we consider two related, analogous models for…
Exceptional sequences are important sequences of quiver representations in the study of representation theory of algebras. They are also closely related to the theory of cluster algebras and the combinatorics of Coxeter groups. We…
Reflection groups, geometry of the discriminant and noncrossing partitions. When W is a well-generated complex reflection group, the noncrossing partition lattice NCP_W of type W is a very rich combinatorial object, extending the notion of…
This article deals with the study of affine cactus groups from a combinatorial point of view. Those groups are extensions of cactus groups, which are related to braid and diagram groups and have gained an important place in many mathematics…
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 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…
For a finite group $G$, a $G$-crossed braided fusion category is $G$-graded fusion category with additional structures, namely a $G$-action and a $G$-braiding. We develop the notion of $G$-crossed braided zesting: an explicit method for…
Ordering permutations by containment of inversion sets yields a fascinating partial order on the symmetric group: the weak order. This partial order is, among other things, a semidistributive lattice. As a consequence, every permutation has…
Chen, Deng, Du, Stanley, and Yan introduced the notion of $k$-crossings and $k$-nestings for set partitions, and proved that the sizes of the largest $k$-crossings and $k$-nestings in the partitions of an $n$-set possess a symmetric joint…
The paper establishes a connection between two recent combinatorial developments in free probability: the non-crossing linked partitions introduced by Dykema in 2007 to study the S-transform, and the partial order << on NC(n) introduced by…
A non-crossing pairing on a bitstring matches 1s and 0s in a manner such that the pairing diagram is nonintersecting. By considering such pairings on arbitrary bitstrings $1^{n_1} 0^{m_1} ... 1^{n_r} 0^{m_r}$, we generalize classical…
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…
In the present paper, we introduce $\mathbb{Z}_2$-braids and, more generally, $G$-braids for an arbitrary group $G$. They form a natural group-theoretic counterpart of $G$-knots, see \cite{reidmoves}. The underlying idea, used in the…
The partition algebras are algebras of diagrams (which contain the group algebra of the symmetric group and the Brauer algebra) such that the multiplication is given by a combinatorial rule and such that the structure constants of the…
We introduce two simplicial complexes, the noncrossing matching complex and the noncrossing bipartite complex. Both complexes are intimately related to the bubble lattice introduced in our earlier article "Bubble Lattices I: Structure"…
The space of unordered configurations of distinct points in the plane is aspherical, with Artin's braid group as its fundamental group. Remarkably enough, the space of ordered configurations of distinct points on the real projective line,…
An avoidance pattern where the letters within an occurrence of which are required to be adjacent is referred to as a subword. In this paper, we enumerate members of the set NC_n of non-crossing partitions of length n according to the number…
In this paper, we address several intersection problems for $r$-cross $t$-intersecting families of partitions. A $k$-partition of an $n$-set $X$ is a set of $k$ pairwise disjoint non-empty subsets whose union is $X$. For $1\leq i\leq r$,…
We classify compact quantum groups associated to noncrossing partitions coloured with two elements $x$ and $y$ which are their own inverses. Together with the work of P. Tarrago and M. Weber, this completes the classification of all…
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…