Constructions for cyclic sieving phenomena
Andrew Berget, Sen-Peng Eu, Victor Reiner
TL;DR
This paper presents a method to generate new cyclic sieving phenomena instances using elementary representation theory, with examples involving words, parking functions, finite fields, and graphs.
Contribution
It introduces a novel approach to derive cyclic sieving phenomena from existing ones through elementary representation theory.
Findings
New cyclic sieving instances derived from known ones
Applications to combinatorial objects like words and parking functions
Connections established with finite fields and graphs
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.