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 generalization of the cluster complexes found by Fomin and Zelevinsky. In this paper, the faces of various dimensions of the generalized cluster complexes in type $A_n$, $B_n$, $D_n$, and $I_2(a)$ are shown to exhibit the cyclic sieving phenomenon under a cyclic group action. For the cluster complexes of exceptional type $E_6$, $E_7$, $E_8$, $F_4$, $H_3$, and $H_4$, a verification for such a phenomenon on their maximal faces is given.
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 $q$-analogue exhibits the cyclic sieving phenomenon under a natural action of the cyclic group. The enumeration and cyclic sieving is generalized to Möbius paths. We also discuss properties of a generalization of cyclic sieving, which we call subset cyclic sieving. Finally, we also introduce the notion of Lyndon-like cyclic sieving that concerns special recursive …
In this paper we prove that the set of non-crossing forests together with a cyclic group acting on it by rotation and a natural q-analogue of the formula for their number exhibits the cyclic sieving phenomenon, as conjectured by Alan Guo.
We show that Schützenberger's promotion on two and three row rectangular Young tableaux can be realized as cyclic rotation of certain planar graphs introduced by Kuperberg. Moreover, following work of the third author, we show that this action admits the cyclic sieving phenomenon.
Prompted by a question of Jim Propp, this paper examines the cyclic sieving phenomenon (CSP) in certain cyclic codes. For example, it is shown that, among dual Hamming codes over $F_q$, the generating function for codedwords according to the major index statistic (resp. the inversion statistic) gives rise to a CSP when $q=2$ or $q=3$ (resp. when $q=2$). A byproduct is a curious characterization of the irreducible polynomials in $F_2[x]$ and $F_3[x]$ that are primitive.
We show how to derive new instances of the cyclic sieving phenomenon from old ones via elementary representation theory. Examples are given involving objects such as words, parking functions, finite fields, and graphs.
The Garsia--Haiman module is a bigraded $\mathfrak{S}_n$-module whose Frobenius image is a Macdonald polynomial. The method of orbit harmonics promotes an $\mathfrak{S}_n$-set $X$ to a graded polynomial ring. The orbit harmonics can be applied to prove cyclic sieving phenomena which is a notion that encapsulates the fixed-point structure of finite cyclic group action on a finite set. By applying this idea to the Garsia--Haiman module, we provide cyclic sieving results regarding the enumeration of matrices that are invariant under certain cyclic row and column rotation and translation of entrie…
We give a new cyclic sieving phenomenon for semistandard Young tableaux $SSYT(λ,μ)$ of shape $λ=(m,n^b)$ and content $μ$, a $(b+2)$-tuple. We prove that $(SSYT(λ,μ),\langle \partial^{b+2} \rangle, f(q))$ exhibits the cyclic sieving phenomenon, where $\partial$ is the jeu de taquin promotion operator and $f(q)$ is a modified Kostka-Foulkes polynomial $\widetilde{K}_{λ,μ}(q)$, up to a power of $q$.
Based on computational experiments, Jim Propp and Vic Reiner suspected that there might exist a sequence of combinatorial objects $X_n$, each carrying a natural action of the cyclic group $C_{n-1}$ of order $n-1$ such that the triple $\left(X_n,C_{n-1},\frac{1}{[n+1]_q}{2n \brack n}_q\right)$ exhibits the cyclic sieving phenomenon. We prove their suspicion right.
We show an instance of the cyclic sieving phenomenon on annular noncrossing permutations with given cycle types. We define annular $q$-Kreweras numbers, annular $q$-Narayana numbers, and annular $q$-Catalan number, all of which are polynomials in $q$. We then show that these polynomials exhibit the cyclic sieving phenomenon on annular noncrossing permutations. We also show that a sum of annular $q$-Kreweras numbers becomes an annular $q$-Narayana number and a sum of $q$-Narayana numbers becomes an annular $q$-Catalan number.
We prove a cyclic sieving result for the set of $3 \times k$ packed increasing tableaux with maximum entry $m :=3+k$ under K-promotion. The "curiosity" is that the sieving polynomial arises from the $q$-hook formula for standard tableaux of "toothbrush shape" $(2^3, 1^{k-2})$ with $m+1$ boxes, whereas K-promotion here only has order $m$.
Orbit harmonics is a tool in combinatorial representation theory which promotes the (ungraded) action of a linear group $G$ on a finite set $X$ to a graded action of $G$ on a polynomial ring quotient by viewing $X$ as a $G$-stable point locus in $\mathbb{C}^n$. The cyclic sieving phenomenon is a notion in enumerative combinatorics which encapsulates the fixed-point structure of the action of a finite cyclic group $C$ on a finite set $X$ in terms of root-of-unity evaluations of an auxiliary polynomial $X(q)$. We apply orbit harmonics to prove cyclic sieving results.
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 the most impressive instances of the cyclic sieving phenomenon is a theorem of Rhoades asserting that the set of plane partitions in a rectangular box under the action of promotion exhibits cyclic sieving. In Rhoades's result the sieving polynomial is the size generating function for these plane partitions, which has a well-known product formula due to MacMah…
In this paper we prove instances of the cyclic sieving phenomenon for finite Grassmannians and partial flag varieties, which carry the action of various tori in the finite general linear group GL_n(F_q). The polynomials involved are sums of certain weights of the minimal length parabolic coset representatives of the symmetric group S_n, where the weight of a coset representative can be written as a product over its inversions.
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 cycle type and fixed number of excedances provides an instance of the cyclic sieving phenonmenon of Reiner, Stanton and White. The main tool is a class of symmetric functions recently introduced in work of two of the authors.
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 Kraskiewicz--Weyman, Stembridge, and Schocker related to the so-called higher Lie modules and branching rules for inclusions $ C_a \wr S_b \hookrightarrow S_{ab} $. Extending the approach gives monomial expansions for certain graded Frobenius series arising from a generalization of Thrall's problem.
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\}$. Confirming a conjecture of Armstrong et. al., we prove that $\mathsf{NC}(a,b)$ is closed under rotation and prove an instance of the cyclic sieving phenomenon for this rotational action. We also define a rational generalization of the $\mathfrak{S}_a$-noncrossing parking functions of Armstrong, Reiner, and Rhoades.
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 conditions for an action. This polynomial will give us a lot of information about the symmetry and structure of the set under the action. In this paper, we study the cyclic sieving phenomenon of the cyclic group $C_{2n}$ acting on $P_{n,k}$, which is the set of matchings of $2n$ points on a circle with $k$ crossings. The noncrossing matchings ($k=0$) was recently…
We discuss two surprising properties of a family of polynomials that generalize the Mahonian $q$-Catalan polynomials, and more generally the $q$-Schröder polynomials. By interpreting them as $\mathfrak{sl}_2$-characters, we show that the rational $q$-Schröder polynomials are parity-unimodal, which means that the even- and odd-degree coefficients are separately unimodal. Second, we show that they exhibit a $q=-1$ phenomenon. This is a special case of a more general cyclic sieving phenomenon for certain transitive $S_n$-actions, deduced from Molien's formula.
Recently, a combinatorial model for torsion pairs in the cluster category of Dynkin type A_n was introduced, and used to derive an explicit formula for their number. In this article we determine the number of torsion pairs that are invariant under b-fold application of Auslander-Reiten translation. It turns out that the set of torsion pairs together with Auslander-Reiten translation, and a natural q-analogue of the formula for the number of all torsion pairs exhibits the cyclic sieving phenomenon.
Reiner-Stanton-White defined the cyclic sieving phenomenon (CSP) associated to a finite cyclic group action and a polynomial. A key example arises from the length generating function for minimal length coset representatives of a parabolic quotient of a finite Coxeter group. In type A, this result can be phrased in terms of the natural cyclic action on words of fixed content. There is a natural notion of refinement for many CSP's. We formulate and prove a refinement, with respect to the major index statistic, of this CSP on words of fixed content by also fixing the cyclic descent type. The argu…
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 similar result for dihedral groups and suggest approaches for natural generalizations to nonabelian groups.
An increasing tableau is a semistandard tableau with strictly increasing rows and columns. It is well known that the Catalan numbers enumerate both rectangular standard Young tableaux of two rows and also Dyck paths. We generalize this to a bijection between rectangular 2-row increasing tableaux and small Schröder paths. We demonstrate relations between the jeu de taquin for increasing tableaux developed by H. Thomas and A. Yong and the combinatorics of tropical frieze patterns. We then use this jeu de taquin to present new instances of the cyclic sieving phenomenon of V. Reiner, D. Stanton, a…
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 complexes of every type using the q-Catalan numbers. In this paper, we exhibit the dihedral sieving phenomenon, introduced for odd n by Rao and Suk, on clusters of every type. In the type A case, we show that the Raney numbers count both reflection-symmetric k-angulations of an n-gon and a particular evaluation of the (q,t)-Fuss--Catalan numbers. We also introduce …
We prove an instance of the cyclic sieving phenomenon, occurring in the context of noncrossing parititions for well-generated complex reflection groups.
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 deformed Coxeter elements on cluster complexes of Fomin and Zelevinsky \cite{FZY}. The Reiner-Stanton-White and Eu-Fu results were proven using direct counting arguments. We give representation theoretic proofs of closely related results using the notion of noncrossing and semi-noncrossing tableaux due to Pylyavskyy \cite{PN} as well as some geometric realiz…
In this paper, we study a new cyclic sieving phenomenon on the set $\mathsf{SST}_n(λ)$ of semistandard Young tableaux with the cyclic action $\mathsf{c}$ arising from its $U_q(\mathfrak{sl}_n)$-crystal structure. We prove that if $λ$ is a Young diagram with $\ell(λ) < n$ and $\gcd( n, |λ| )=1$, then the triple $\left( \mathsf{SST}_n(λ), \mathsf{C}, q^{- κ(λ)} s_λ(1,q, \ldots, q^{n-1}) \right) $ exhibits the cyclic sieving phenomenon, where $\mathsf{C}$ is the cyclic group generated by $\mathsf{c}$. We further investigate a connection between $\mathsf{c}$ and the promotion $\mathsf{pr}$ and sho…
We show that the set R(w_0) of reduced expressions for the longest element in the hyperoctahedral group exhibits the cyclic sieving phenomenon. More specifically, R(w_0) possesses a natural cyclic action given by moving the first letter of a word to the end, and we show that the orbit structure of this action is encoded by the generating function for the major index on R(w_0).
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. This manuscript accompanies the paper "Cyclic sieving for generalised non-crossing partitions associated to complex reflection groups of exceptional type" [arXiv:1001.0028], for which it provides the computational details.
We establish a supercongruence conjectured by Almkvist and Zudilin, by proving a corresponding $q$-supercongruence. Similar $q$-supercongruences are established for binomial coefficients and the Apéry numbers, by means of a general criterion involving higher derivatives at roots of unity. Our methods lead us to discover new examples of the cyclic sieving phenomenon, involving the $q$-Lucas numbers.
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 (X,C,f(q)) exhibits the cyclic sieving phenomenon if, for all g in C, we have # X^g = f(w) where # denotes cardinality, X^g is the fixed point set of g, and w is a root of unity chosen to have the same order as g. It might seem improbable that substituting a root of unity into a polynomial with integer coefficients would have an enumerative meaning. But many in…
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 complex reflection groups. The computational details are provided in the manuscript "Cyclic sieving for generalised non-crossing partitions associated to complex reflection groups of exceptional type - the details" [arXiv:1001.0030].
We construct a large class of examples of the cyclic sieving phenomenon by expoiting the representation theory of semi-simple Lie algebras. Let $M$ be a finite dimensional representation of a semi-simple Lie algebra and let $B$ be the associated Kashiwara crystal. For $r\ge 0$, the triple $(X,c,P)$ which exhibits the cyclic sieving phenomenon is constructed as follows: the set $X$ is the set of isolated vertices in the crystal $\otimes^rB$; the map $c\colon X\rightarrow X$ is a generalisation of promotion acting on standard tableaux of rectangular shape and the polynomial $P$ is the fake degre…
We prove a collection of conjectures of D. White \cite{WComm}, as well as some related conjectures of Abuzzahab-Korson-Li-Meyer \cite{AKLM} and of Reiner and White \cite{ReinerComm}, \cite{WComm}, regarding the cyclic sieving phenomenon of Reiner, Stanton, and White \cite{RSWCSP} as it applies to jeu-de-taquin promotion on rectangular tableaux. To do this, we use Kazhdan-Lusztig theory and a characterization of the dual canonical basis of $\mathbb{C}[x_{11}, ..., x_{nn}]$ due to Skandera \cite{SkanNNDCB}. Afterwards, we extend our results to analyzing the fixed points of a dihedral action on r…
We study rotation of invariant vectors in tensor products of minuscule representations. We define a combinatorial notion of rotation of minuscule Littelmann paths. Using affine Grassmannians, we show that this rotation action is realized geometrically as rotation of components of the Satake fibre. As a consequence, we have a basis for invariant spaces which is permuted by rotation (up to global sign). Finally, we diagonalize the rotation operator by showing that its eigenspaces are given by intersection homology of quiver varieties. As a consequence, we generalize Rhoades' work on the cyclic s…
Let $k$ and $m$ be positive integers and $λ/μ$ a skew partition. We compute the principal specialization of the skew Schur polynomials $s_{λ/μ}(x_1, \ldots, x_{k})$ modulo $q^m-1$ under suitable conditions. We interpret the results thus obtained from the viewpoint of the cyclic sieving phenomenon on semistandard Young skew tableaux of shape $λ/μ$. As an application, we deal with evaluations of the principal specialization of the skew Schur polynomials at roots of unity.
The paper concerns a definition for $q$-Kreweras numbers for finite Weyl groups $W$, refining the $q$-Catalan numbers for $W$, and arising from work of the second author. We give explicit formulas in all types for the $q$-Kreweras numbers. In the classical types $A, B, C$, we also record formulas for the $q$-Narayana numbers and in the process show that the formulas depend only on the Weyl group (that is, they coincide in types $B$ and $C$). In addition we verify that in the classical types $A,B,C,D$ that the $q$-Kreweras numbers obey the expected cyclic sieving phenomena when evaluated at app…
We construct a (bi)cyclic sieving phenomenon on the union of dominant maximal weights for level $\ell$ highest weight modules over an affine Kac-Moody algebra with exactly one highest weight being taken for each equivalence class, in a way not depending on types, ranks and levels. In order to do that, we introduce $\textbf{\textit{S}}$-evaluation on the set of dominant maximal weights for each highest modules, and generalize Sagan's action by considering the datum on each affine Kac-Moody algebra. As consequences, we obtain closed and recursive formulae for cardinality of the number of dominan…
A combinatorial expression for the coefficient of the Schur function $s_λ$ in the expansion of the plethysm $p_{n/d}^d \circ s_μ$ is given for all $d$ dividing $n$ for the cases in which $n=2$ or $λ$ is rectangular. In these cases, the coefficient $\langle p_{n/d}^d \circ s_μ, s_λ \rangle$ is shown to count, up to sign, the number of fixed points of an $\langle s_μ^n, s_λ \rangle$-element set under the $d^{\text{th}}$ power of an order-$n$ cyclic action. If $n=2$, the action is the Schützenberger involution on semistandard Young tableaux (also known as evacuation), and, if $λ$ is rectangular, …
In this paper, we compute explicitly the $q$-dimensions of highest weight crystals modulo $q^n-1$ for a quantum group of arbitrary finite type under certain assumption, and interpret the modulo computations in terms of the cyclic sieving phenomenon. This interpretation gives an affirmative answer to the conjecture by Alexandersson and Amini. As an application, under the assumption that $λ$ is a partition of length $<m$ and there exists a fixed point in $\mathsf{SST}_m(λ)$ under the action $\mathsf{c}$ arising from the crystal structure, we show that the triple $(\mathsf{SST}_m(λ), \langle \mat…
We study cyclic sieving phenomena (CSP) on combinatorial objects from an abstract point of view by considering a rational polyhedral cone determined by the linear equations that define such phenomena. Each lattice point in the cone corresponds to a non-negative integer matrix which jointly records the statistic and cyclic order distribution associated with the set of objects realizing the CSP. In particular we consider a universal subcone onto which every CSP matrix linearly projects such that the projection realizes a CSP with the same cyclic orbit structure, but via a universal statistic tha…
Let $δ=(δ_1,\ldots,δ_n)$ be a string of letters $h$ and $v$. We define a Young tableau to be $δ$-semistandard if the entries are weakly increasing along rows and columns, and the entries $i$ form a horizontal strip if $δ_i=h$ and a vertical strip if $δ_i=v$. We define $δ$-promotion on such tableaux via a modified jeu-de-taquin. The first main result is that $δ$-promotion has period $n$ on rectangular $δ$-semistandard tableaux, generalizing the results of Haiman and Rhoades for standard and semistandard tableaux. The second main result states that the set of rectangular $δ$-semistandard tableau…
We introduce a decorated configuration space $\mathscr{C}\!{\rm onf}_n^\times(a)$ with a potential function $\mathcal{W}$. We prove the cluster duality conjecture of Fock-Goncharov for Grassmannians, that is, the tropicalization of $\big(\mathscr{C}\!{\rm onf}_n^\times(a), \mathcal{W}\big)$ canonically parametrizes a linear basis of the homogeneous coordinate ring of the Grassmannian $\operatorname{Gr}_a(n)$ with respect to the Plücker embedding. We prove that $\big(\mathscr{C}\!{\rm onf}_n^\times(a), \mathcal{W}\big)$ is equivalent to the mirror Landau-Ginzburg model of the Grassmannian consi…
