Restricted Permutations Enumerated by Inversions
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_ | 1866913402634371072 |
|---|---|
| author | Franklín, Atli Fannar Claesson, Anders Bean, Christian Úlfarsson, Henning Pantone, Jay |
| author_facet | Franklín, Atli Fannar Claesson, Anders Bean, Christian Úlfarsson, Henning Pantone, Jay |
| contents | Permutations are usually enumerated by size, but new results can be found by enumerating them by inversions instead, in which case one must restrict one's attention to indecomposable permutations. In the style of the seminal paper by Simion and Schmidt, we investigate all combinations of permutation patterns of length at most 3. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_16403 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Restricted Permutations Enumerated by Inversions Franklín, Atli Fannar Claesson, Anders Bean, Christian Úlfarsson, Henning Pantone, Jay Discrete Mathematics Permutations are usually enumerated by size, but new results can be found by enumerating them by inversions instead, in which case one must restrict one's attention to indecomposable permutations. In the style of the seminal paper by Simion and Schmidt, we investigate all combinations of permutation patterns of length at most 3. |
| title | Restricted Permutations Enumerated by Inversions |
| topic | Discrete Mathematics |
| url | https://arxiv.org/abs/2406.16403 |