Mathematics – Combinatorics
Scientific paper
2010-08-04
Mathematics
Combinatorics
48 pages, 3 figures, the sedcond version contains numerous changes suggested by colleagues and the referee. To appear in the L
Scientific paper
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.
No associations
LandOfFree
The cyclic sieving phenomenon: a survey does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The cyclic sieving phenomenon: a survey, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The cyclic sieving phenomenon: a survey will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-82930