arXiv Analytics

Sign in

arXiv:1004.0747 [math.CO]AbstractReferencesReviewsResources

Constructions for cyclic sieving phenomena

Andrew Berget, Sen-Peng Eu, Victor Reiner

Published 2010-04-06, updated 2011-01-11Version 2

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.

Comments: 18 pages, typos fixed, to appear in SIAM J. Discrete Math
Journal: SIAM J. Discrete Math., 25(3), 1297-1314. (18 pages), 2011
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:1809.07866 [math.CO] (Published 2018-09-20)
Constructions and uses of incomplete pairwise balanced designs
arXiv:1008.0790 [math.CO] (Published 2010-08-04, updated 2011-02-09)
The cyclic sieving phenomenon: a survey
arXiv:1409.2841 [math.CO] (Published 2014-09-09)
Increasing tableaux and Narayana numbers

Links

Toolbox