Restricted permutations enumerated by inversions

Electronic Proceedings in Theoretical Computer Science, Volume 403 (GASCom 2024), Pages 96–100, 2024

Christian, Anders, Atli Fannar, Jay and Henning

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.

Download the paper