Cyclic sieving phenomena via combinatorics of continued fractions
Abstract: We will exhibit several instances of the cyclic sieving phenomenon involving statistics and involutions on the following combinatorial families of objects: permutations, set partitions, perfect matchings, D-permutations (and its subclasses). Our results will be based on continued fraction identities enumerating these objects. Our instances of cyclic sieving phenomenon for permutations involve the Corteel involution; this was first studied by Adams, Elder, Lafreni`ere, McNicholas, Striker and Welch (arxiv~2024). We will reprove several of their results using our setting of continued fractions; we will also prove two of their conjectures. Our study of set partitions and perfect matchings will involve the Kasraoui--Zeng involution and the Chen--Deng--Du--Stanley--Yan (CDDSY) involution. Finally, for D-permutations, we will construct a new involution which we call the Genocchi--Corteel involution. The common feature of all of these involutions, other than the CDDSY involution, is that they are constructed via bijections to weighted lattice paths, and that they exchange crossings and nestings on their respective objects.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.