Restricted Permutations Enumerated by Inversions
<|reference_start|>Restricted Permutations Enumerated by Inversions: 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.<|reference_end|>
@article{franklín2024restricted,
    title={Restricted Permutations Enumerated by Inversions},
    author={Atli Fannar Frankl'in, Anders Claesson, Christian Bean, Henning
  'Ulfarsson, Jay Pantone},
    journal={EPTCS 403, 2024, pp. 96-100},
    year={2024},
    doi={10.4204/EPTCS.403.21},
    archivePrefix={arXiv},
    eprint={2406.16403},
    primaryClass={cs.DM}
}