The cyclic sieving phenomenon

Abstract

AbstractThe cyclic sieving phenomenon is defined for generating functions of a set affording a cyclic group action, generalizing Stembridge's q=−1 phenomenon. The phenomenon is shown to appear in various situations, involving q-binomial coefficients, Pólya–Redfield theory, polygon dissections, noncrossing partitions, finite reflection groups, and some finite field q-analogues