Related papers: Cyclic sieving for generalised non-crossing partit…

We present the proof of the cyclic sieving conjectures for generalised non-crossing partitions associated to well-generated complex reflection groups due to Armstrong, respectively to Bessis and Reiner, for the 26 exceptional well-generated…

We prove an instance of the cyclic sieving phenomenon, occurring in the context of noncrossing parititions for well-generated complex reflection groups.

We introduce a new class of reflection groups associated with the canonical bilinear lattices of Lenzing, which we call reflection groups of canonical type. The main result of this work is a categorification of the corresponding poset of…

We present an elementary type preserving bijection between noncrossing and nonnesting partitions for all classical reflection groups, answering a question of Athanasiadis.

The purpose of this note is to complete the study, begun in the first author's PhD thesis, of the topology of the poset of generalized noncrossing partitions associated to real reflection groups. In particular, we calculate the Euler…

Let $a < b$ be coprime positive integers. Armstrong, Rhoades, and Williams defined a set $\mathsf{NC}(a,b)$ of `rational noncrossing partitions', which form a subset of the ordinary noncrossing partitions of $\{1, 2, \dots, b-1\}$.…

We consider noncrossing partitions of [n] under the action of (i) the reflection group (of order 2), (ii) the rotation group (cyclic of order n) and (iii) the rotation/reflection group (dihedral of order 2n). First, we exhibit a bijection…

This note discusses the bijection between the exceptional subcategories of representations of quivers and generalized non-crossing partitions of Weyl groups. We give a new proof of the Ingalls-Thomas-Igusa-Schiffler bijection by using the…

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…

We enumerate factorizations of a Coxeter element in a well generated complex reflection group into arbitrary factors, keeping track of the fixed space dimension of each factor. In the infinite families of generalized permutations, our…

Schutzenberger's theorem for the ordinary RSK correspondence naturally extends to Chen et. al's correspondence for matchings and partitions. Thus the counting of bilaterally symmetric $k$-noncrossing partitions naturally arises as an…

The notion of cyclic sieving phenomenon is introduced by Reiner, Stanton, and White as a generalization of Stembridge's $q=-1$ phenomenon. The generalized cluster complexes associated to root systems are given by Fomin and Reading as a…

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…

We investigate a new lattice of generalised non-crossing partitions, constructed using the geometry of the complex reflection group $G(e,e,r)$. For the particular case $e=2$ (resp. $r=2$), our lattice coincides with the lattice of simple…

We give a $q$-enumeration of circular Dyck paths, which is a superset of the classical Dyck paths enumerated by the Catalan numbers. These objects have recently been studied by Alexandersson and Panova. Furthermore, we show that this…

We prove an instance of the cyclic sieving phenomenon in non-crossing connected graphs, as conjectured by S.-P. Eu.

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…

Cyclic sieving is a well-known phenomenon where certain interesting polynomials, especially $q$-analogues, have useful interpretations related to actions and representations of the cyclic group. We propose a definition of sieving for an…

The cyclic sieving phenomenon is a well-studied occurrence in combinatorics appearing when a cyclic group acts on a finite set. In this paper, we demonstrate a natural extension of this theory to finite abelian groups. We also present a…

We exhibit two instances of the cyclic sieving phenomenon - one on dissections of a polygon of a fixed type and one on triangulations of a once-punctured polygon. We use these results to give refined enumerations of certain families of…