Restricted Permutations Enumerated by Inversions
Discrete Mathematics
2024-06-25 v1
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.2406.16403,
title = {Restricted Permutations Enumerated by Inversions},
author = {Atli Fannar Franklín and Anders Claesson and Christian Bean and Henning Úlfarsson and Jay Pantone},
journal= {arXiv preprint arXiv:2406.16403},
year = {2024}
}
Comments
In Proceedings GASCom 2024, arXiv:2406.14588