Atli Fannar Franklín - Pattern Avoiding Permutations Enumerated by Inversions

dmtcs:14437 - Discrete Mathematics & Theoretical Computer Science, May 26, 2025, vol. 27:1, Permutation Patterns 2024 - https://doi.org/10.46298/dmtcs.14437
Pattern Avoiding Permutations Enumerated by InversionsArticle

Authors: Atli Fannar Franklín

    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.

    Comment: Update: Address review comments after submission to DMTCS Update:
    Copy version for DMTCS

    https://doi.org/10.46298/dmtcs.14437
    Source: arXiv.org:2410.07467
    Volume: vol. 27:1, Permutation Patterns 2024
    Section: Special issues
    Published on: May 26, 2025
    Accepted on: May 21, 2025
    Submitted on: October 11, 2024
    Keywords: Mathematics - Combinatorics, 05A05
    Licence: arXiv.org - Non-exclusive license to distribute

    Share and export

    Consultation statistics

    This page has been seen 420 times.
    This article's PDF has been downloaded 3163 times.