Learn More
The 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, Poíya–Redfield theory, polygon dissections, noncrossing partitions, finite reflection groups, and some finite(More)
To Anders Björner on his 60 th birthday. Abstract. We start with a (q, t)-generalization of a binomial coefficient. It can be viewed as a polynomial in t that depends upon an integer q, with combinatorial interpretations when q is a positive integer, and algebraic interpretations when q is the order of a finite field. These (q, t)-binomial coefficients and(More)