Constructions for cyclic sieving phenomena

Abstract

We show how to derive new instances of the cyclic sieving phenomenon from old ones via elementary representation theory. Examples are given involving objects such as words, parking functions, finite fields, and graphs.

18 pages, typos fixed, to appear in SIAM J. Discrete Math

References in corpus (1)

• Bimahonian distributions

Cited by in corpus (2)

• The Cone of Cyclic Sieving Phenomena
• Cyclic sieving of finite Grassmannians and flag varieties