Related papers: The Cyclic Sieving Phenomenon for Faces of General…
The cyclic sieving phenomenon was introduced by Reiner, Stanton and White in 2004 as a generalization of Stembridge's $q=-1$ phenomenon. In a paper from 2008, Eu and Fu studied many occurrences of this phenomenon on the faces of the…
The cyclic sieving phenomenon of Reiner, Stanton, and White characterizes the stabilizers of cyclic group actions on finite sets using q-analogue polynomials. Eu and Fu demonstrated a cyclic sieving phenomenon on generalized cluster…
The cyclic sieving phenomenon was defined by Reiner, Stanton, and White in a 2004 paper. Let X be a finite set, C be a finite cyclic group acting on X, and f(q) be a polynomial in q with nonnegative integer coefficients. Then the triple…
The generalized cluster complex was introduced by Fomin and Reading, as a natural extension of the Fomin-Zelevinsky cluster complex coming from finite type cluster algebras. In this work, to each face of this complex we associate a…
Reiner, Stanton, and White \cite{RSWCSP} proved results regarding the enumeration of polygon dissections up to rotational symmetry. Eu and Fu \cite{EuFu} generalized these results to Cartan-Killing types other than A by means of actions of…
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…
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 (CSP) was introduced by Reiner, Stanton, and White to study combinatorial structures with actions of cyclic groups. The crucial step is to find a polynomial, for example a q-analog, that satisfies the CSP…
The cyclic sieving phenomenon of Reiner, Stanton, and White says that we can often count the fixed points of elements of a cyclic group acting on a combinatorial set by plugging roots of unity into a polynomial related to this set. One of…
It is proved that the generalized cluster complex defined by Fomin and Reading has a dihedral symmetry. Together with diagram symmetries, they generate its automorphism group. A consequence is a simple explicit formula for the order of this…
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 show that the cyclic sieving phenomenon of Reiner--Stanton--White together with necklace generating functions arising from work of Klyachko offer a remarkably unified, direct, and largely bijective approach to a series of results due to…
Let $\Phi$ be an finite root system with corresponding reflection group $W$ and let $m$ be a nonnegative integer. We consider the generalized cluster complex $\Delta^m(\Phi)$ defined by S. Fomin and N. Reading and the poset $NC_{(m)}(W)$ of…
We prove an instance of the cyclic sieving phenomenon, occurring in the context of noncrossing parititions for well-generated complex reflection groups.
We prove that the generalised non-crossing partitions associated to well-generated complex reflection groups of exceptional type obey two different cyclic sieving phenomena, as conjectured by Armstrong, respectively by Bessis and Reiner.…
Cluster algebras were introduced by S. Fomin and A. Zelevinsky in connection with dual canonical bases. Let U be a cluster algebra of type A_n. We associate to each cluster C of U an abelian category Cat_C such that the indecomposable…
Cluster algebras are commutative rings with a set of distinguished generators having a remarkable combinatorial structure. They were introduced by Fomin and Zelevinsky in 2000 in the context of Lie theory, but have since appeared in many…
It is shown that a refined version of a q-analogue of the Eulerian numbers together with the action, by conjugation, of the subgroup of the symmetric group $S_n$ generated by the $n$-cycle $(1,2,...,n)$ on the set of permutations of fixed…
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…
Cyclic poset are generalizations of cyclically ordered sets. In this paper we show that any cyclic poset gives rise to a Frobenius category over any discrete valuation ring R. The continuous cluster categories of arXiv:1209.1879 are…