Descents and inversions in powers of permutations
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_ | 1866929470975246336 |
|---|---|
| author | Cambie, Stijn Yan, Jun |
| author_facet | Cambie, Stijn Yan, Jun |
| contents | In this paper, we generalise several recent results by Archer and Geary on descents in powers of permutations, and confirm all their conjectures. Specifically, for all $k\in\mathbb{Z}^+$, we prove explicit formulas for the expected numbers of descents and inversions in the $k$-th powers of permutations in $\mathcal{S}_n$ for all $n\geq2k+1$. We also compute the number of Grassmanian permutations in $\mathcal{S}_n$ whose $k$-th powers remain Grassmanian, and the number of permutations in $\mathcal{S}_n$ whose $k$-th powers have the maximum number of descents. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_01211 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Descents and inversions in powers of permutations Cambie, Stijn Yan, Jun Combinatorics 05A05 In this paper, we generalise several recent results by Archer and Geary on descents in powers of permutations, and confirm all their conjectures. Specifically, for all $k\in\mathbb{Z}^+$, we prove explicit formulas for the expected numbers of descents and inversions in the $k$-th powers of permutations in $\mathcal{S}_n$ for all $n\geq2k+1$. We also compute the number of Grassmanian permutations in $\mathcal{S}_n$ whose $k$-th powers remain Grassmanian, and the number of permutations in $\mathcal{S}_n$ whose $k$-th powers have the maximum number of descents. |
| title | Descents and inversions in powers of permutations |
| topic | Combinatorics 05A05 |
| url | https://arxiv.org/abs/2408.01211 |