Pattern Avoiding Permutations Enumerated by Inversions
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916760758779904 |
|---|---|
| author | Franklín, Atli Fannar |
| author_facet | Franklín, Atli Fannar |
| 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_2410_07467 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Pattern Avoiding Permutations Enumerated by Inversions Franklín, Atli Fannar Combinatorics 05A05 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 | Pattern Avoiding Permutations Enumerated by Inversions |
| topic | Combinatorics 05A05 |
| url | https://arxiv.org/abs/2410.07467 |