Algorithmic coincidence classification of mesh patterns
From MaRDI portal
Publication:6040657
DOI10.1016/j.ic.2023.105014arXiv1910.08127OpenAlexW2980546389MaRDI QIDQ6040657
Christian Bean, Henning Úlfarsson, Tomas Ken Magnusson, Bjarki Agust Gudmundsson
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
Cites Work
- Coincidental pattern avoidance
- Mesh patterns and the expansion of permutation statistics as sums of permutation patterns
- Sorting twice through a stack
- Describing West-3-stack-sortable permutations with permutation patterns
- Mesh patterns with superfluous mesh
- Finding regular insertion encodings for permutation classes
- Wilf-classification of mesh patterns of short length
- (2+2)-free posets, ascent sequences and pattern avoiding permutations
- Generalized permutation patterns and a classification of the Mahonian statistics
- The insertion encoding of permutations
- Coincidence among families of mesh patterns
- Equivalence classes of mesh patterns with a dominating pattern
- Restricted permutations
This page was built for publication: Algorithmic coincidence classification of mesh patterns