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.
@inproceedings{franklin2024inversions,
author = {Frankl{\'i}n, Atli Fannar and Claesson, Anders and Bean, Christian and {\'U}lfarsson, Henning and Pantone, Jay},
title = {Restricted permutations enumerated by inversions},
booktitle = {Proceedings of the 13th edition of the conference on Random Generation of Combinatorial Structures. Polyominoes and Tilings ({GASCom} 2024)},
series = {Electronic Proceedings in Theoretical Computer Science},
volume = {403},
pages = {96--100},
year = {2024},
doi = {10.4204/EPTCS.403.21},
}