Constructions for cyclic sieving phenomena
classification
🧮 math.CO
keywords
cyclicsievingconstructionsderiveelementaryexamplesfieldsfinite
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.