Toufik Mansour ; Howard Skogman ; Rebecca Smith - Sorting inversion sequences

dmtcs:14010 - Discrete Mathematics & Theoretical Computer Science, February 11, 2025, vol. 27:1, Permutation Patterns 2024 - https://doi.org/10.46298/dmtcs.14010
Sorting inversion sequencesArticle

Authors: Toufik Mansour ; Howard Skogman ; Rebecca Smith

    We consider the avoidance of patterns in inversion sequences that relate sorting via sorting machines including data structures such as pop stacks and stacks. Such machines have been studied under a variety of additional constraints and generalizations, some of which we apply here. We give the classification of several classes of sortable inversion sequences in terms of pattern avoidance. We are able to provide an exact enumeration of some of the sortable classes in question using both classical approaches and a more recent strategy utilizing generating trees.


    Volume: vol. 27:1, Permutation Patterns 2024
    Section: Special issues
    Published on: February 11, 2025
    Accepted on: January 29, 2025
    Submitted on: July 31, 2024
    Keywords: Mathematics - Combinatorics,05A05, 05A15, 68R05, 68R15, 06A07, 68W32

    Consultation statistics

    This page has been seen 144 times.
    This article's PDF has been downloaded 63 times.