Cyclic sieving on permutations -- an analysis of maps and statistics in the FindStat database
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866916796074819584 |
|---|---|
| author | Adams, Ashleigh Elder, Jennifer Lafrenière, Nadia McNicholas, Erin Striker, Jessica Welch, Amanda |
| author_facet | Adams, Ashleigh Elder, Jennifer Lafrenière, Nadia McNicholas, Erin Striker, Jessica Welch, Amanda |
| contents | We perform a systematic study of permutation statistics and bijective maps on permutations using SageMath to search the FindStat combinatorial statistics database to identify apparent instances of the cyclic sieving phenomenon (CSP). Cyclic sieving occurs on a set of objects, a statistic, and a map of order $n$ when the evaluation of the statistic generating function at the $d$th power of the primitive $n$th root of unity equals the number of fixed points under the $d$th power of the map. Of the apparent instances found in our experiment, we prove 34 new instances of the CSP and conjecture three more. Our results are organized largely by orbit structure, proving instances of the CSP for involutions with $2^{n-1}$ fixed points and $2^{\lfloor\frac{n}{2}\rfloor}$ fixed points, as well as maps whose orbits all have the same size. The FindStat maps which exhibit the CSP include a map constructed by Corteel (using a bijection of Foata and Zeilberger) to swap the number of nestings and crossings, the invert Laguerre heap map, a map of Alexandersson and Kebede designed to preserve right-to-left minima, conjugation by the long cycle, as well as reverse, complement, rotation, Lehmer code rotation, and toric promotion. Our results combined with those of [Elder, Lafrenière, McNicholas, Striker, Welch 2023] show that, contrary to common expectations, actions that exhibit homomesy are not necessarily the best candidates for the CSP, and vice versa. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_16251 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Cyclic sieving on permutations -- an analysis of maps and statistics in the FindStat database Adams, Ashleigh Elder, Jennifer Lafrenière, Nadia McNicholas, Erin Striker, Jessica Welch, Amanda Combinatorics 05A05, 05E18 We perform a systematic study of permutation statistics and bijective maps on permutations using SageMath to search the FindStat combinatorial statistics database to identify apparent instances of the cyclic sieving phenomenon (CSP). Cyclic sieving occurs on a set of objects, a statistic, and a map of order $n$ when the evaluation of the statistic generating function at the $d$th power of the primitive $n$th root of unity equals the number of fixed points under the $d$th power of the map. Of the apparent instances found in our experiment, we prove 34 new instances of the CSP and conjecture three more. Our results are organized largely by orbit structure, proving instances of the CSP for involutions with $2^{n-1}$ fixed points and $2^{\lfloor\frac{n}{2}\rfloor}$ fixed points, as well as maps whose orbits all have the same size. The FindStat maps which exhibit the CSP include a map constructed by Corteel (using a bijection of Foata and Zeilberger) to swap the number of nestings and crossings, the invert Laguerre heap map, a map of Alexandersson and Kebede designed to preserve right-to-left minima, conjugation by the long cycle, as well as reverse, complement, rotation, Lehmer code rotation, and toric promotion. Our results combined with those of [Elder, Lafrenière, McNicholas, Striker, Welch 2023] show that, contrary to common expectations, actions that exhibit homomesy are not necessarily the best candidates for the CSP, and vice versa. |
| title | Cyclic sieving on permutations -- an analysis of maps and statistics in the FindStat database |
| topic | Combinatorics 05A05, 05E18 |
| url | https://arxiv.org/abs/2402.16251 |