Constructions for cyclic sieving phenomena
Combinatorics
2012-08-06 v2
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.
Cite
@article{arxiv.1004.0747,
title = {Constructions for cyclic sieving phenomena},
author = {Andrew Berget and Sen-Peng Eu and Victor Reiner},
journal= {arXiv preprint arXiv:1004.0747},
year = {2012}
}
Comments
18 pages, typos fixed, to appear in SIAM J. Discrete Math