Cyclic Sieving for Plane Partitions and Symmetry

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 MacMahon. We extend Rhoades's result by also considering symmetries of plane partitions: specifically, complementation and transposition. The relevant polynomial here is the size generating function for symmetric plane partitions, whose product formula was conjectured by MacMahon and proved by Andrews and Macdonald. Finally, we explain how these symmetry results also apply to the rowmotion operator on plane partitions, which is closely related to promotion.

Crystals, Semistandard Tableaux and Cyclic Sieving Phenomenon

In this paper, we study a new cyclic sieving phenomenon on the set $\mathsf{SST}_n(\lambda)$ of semistandard Young tableaux with the cyclic action $\mathsf{c}$ arising from its $U_q(\mathfrak{sl}_n)$-crystal structure. We prove that if $\lambda$ is a Young diagram with $\ell(\lambda) < n$ and $\gcd( n, |\lambda| )=1$, then the triple $\left( \mathsf{SST}_n(\lambda), \mathsf{C}, q^{- \kappa(\lambda)} s_\lambda(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 show the bicyclic sieving phenomenon given by $\mathsf{c}$ and $\mathsf{pr}^n$ for hook shape.

The Cyclic Sieving Phenomenon on Circular Dyck Paths

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, and introduce the notion of Lyndon-like cyclic sieving that concerns special recursive properties of combinatorial objects exhibiting the cyclic sieving phenomenon.

q-Congruences, with applications to supercongruences and the cyclic sieving phenomenon

We establish a supercongruence conjectured by Almkvist and Zudilin, by proving a corresponding [Formula: see text]-supercongruence. Similar [Formula: see text]-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 [Formula: see text]-Lucas numbers.

Cyclic Sieving, Necklaces, and Branching Rules Related to Thrall's Problem

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 Kraśkiewicz-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.

Toggling Independent Sets of a Path Graph

This paper explores the orbit structure and homomesy (constant averages over orbits) properties of certain actions of toggle groups on the collection of independent sets of a path graph. In particular we prove a generalization of a homomesy conjecture of Propp that for the action of a "Coxeter element" of vertex toggles, the difference of indicator functions of symmetrically-located vertices is 0-mesic. Then we use our analysis to show facts about orbit sizes that are easy to conjecture but nontrivial to prove. Besides its intrinsic interest, this particular combinatorial dynamical system is valuable in providing an interesting example of (a) homomesy in a context where large orbit sizes make a cyclic sieving phenomenon unlikely to exist, (b) the use of Coxeter theory to greatly generalize the set of actions for which results hold, and (c) the usefulness of Striker's notion of generalized toggle groups.