Skip to main content
Constructions for cyclic sieving phenomena
Published Web Locationhttps://arxiv.org/pdf/1004.0747.pdf
No data is associated with this publication.
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.
Item not freely available? Link broken?Report a problem accessing this item