Algorithmic coincidence classification of mesh patterns

DOI10.1016/J.IC.2023.105014MaRDI QIDQ6040657zbMATH OpenOpenAlexFDO

Authors Christian Bean, Bjarki Agust Gudmundsson, Tomas Ken Magnusson, Henning Úlfarsson

Publication date 19 May 2023

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1910.08127

zbMATH Keywords

enumerationpermutation patternsWilf-classification

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Abstract: 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.

Cites work

• (2+2)-free posets, ascent sequences and pattern avoiding permutations
• Coincidence among families of mesh patterns
• Coincidental pattern avoidance
• Describing West-3-stack-sortable permutations with permutation patterns
• Equivalence classes of mesh patterns with a dominating pattern
• Finding regular insertion encodings for permutation classes
• Generalized permutation patterns and a classification of the Mahonian statistics
• Mesh patterns and the expansion of permutation statistics as sums of permutation patterns
• Mesh patterns with superfluous mesh
• Restricted permutations
• Sorting twice through a stack
• The insertion encoding of permutations
• Wilf-classification of mesh patterns of short length

Cited in

(3)

• Combinatorial generation via permutation languages. VI: Binary trees
• Distributions of mesh patterns of short lengths on king permutations
• On (joint) equidistributions of mesh patterns 123 and 132 with symmetric shadings

This page was built for publication: Algorithmic coincidence classification of mesh patterns

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6040657)