The cyclic sieving phenomenon: a survey

From MaRDI portal
Publication:3089370

zbMATH Open1233.05028arXiv1008.0790MaRDI QIDQ3089370FDOQ3089370

Bruce E. Sagan

Publication date: 24 August 2011

Abstract: 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 instances of the cyclic sieving phenomenon have now been found. Furthermore, the proofs that this phenomenon hold often involve interesting and sometimes deep results from representation theory. We will survey the current literature on cyclic sieving, providing the necessary background about representations, Coxeter groups, and other algebraic aspects as needed.


Full work available at URL: https://arxiv.org/abs/1008.0790






Cited In (46)


Recommendations





This page was built for publication: The cyclic sieving phenomenon: a survey

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3089370)