The cyclic sieving phenomenon

  • Authors:
  • V. Reiner;D. Stanton;D. White

  • Affiliations:
  • Department of Mathematics School of Mathematics, University of Minnesota, Minneapolis, MN;Department of Mathematics School of Mathematics, University of Minnesota, Minneapolis, MN;Department of Mathematics School of Mathematics, University of Minnesota, Minneapolis, MN

  • Venue:
  • Journal of Combinatorial Theory Series A
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

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, Pólya-Redfield theory, polygon dissections, noncrossing partitions, finite reflection groups, and some finite field q-analogues.