Bean, C, Gudmundsson, B, Magnusson, TK and Ulfarsson, H (2023) Algorithmic coincidence classification of mesh patterns. Information and Computation, 292. ISSN 0890-5401

[thumbnail of shading_alg_after_review.pdf] Text
shading_alg_after_review.pdf - Accepted Version
Restricted to Repository staff only until 24 February 2025.
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (519kB)


Permutations have connections to other mathematical objects such as Schubert varieties, sorting networks, and genome rearrangements. Often the connection is described in terms of patterns that are absent from the permutations. There can be ambiguity in this description, in the sense that the same subset of permutations can be defined with two different patterns. This is called coincidence and we focus on the coincidence of mesh patterns, one of the most descriptive version of patterns in permutations. We review and extend previous results on coincidence of mesh patterns. We introduce the notion of a force on a permutation pattern and apply it to the coincidence classification of mesh patterns, completing the classification up to size three. We also show that this concept can be used to enumerate classical permutation classes.

Item Type: Article
Additional Information: The final version of this article and all relevant information related to it, including copyrights, can be found on the publisher website.
Subjects: Q Science > Q Science (General)
Q Science > QA Mathematics
T Technology > T Technology (General)
Divisions: Faculty of Natural Sciences > School of Computing and Mathematics
Depositing User: Symplectic
Date Deposited: 18 Apr 2023 14:39
Last Modified: 18 Apr 2023 14:39

Actions (login required)

View Item
View Item