Pattern Avoiding Permutations Enumerated by Inversions
Combinatorics
2025-05-28 v4
Abstract
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.
Cite
@article{arxiv.2410.07467,
title = {Pattern Avoiding Permutations Enumerated by Inversions},
author = {Atli Fannar Franklín},
journal= {arXiv preprint arXiv:2410.07467},
year = {2025}
}
Comments
Update: Address review comments after submission to DMTCS Update: Copy version for DMTCS