Coincidental pattern avoidance
From MaRDI portal
Publication:376558
DOI10.4310/JOC.2013.V4.N3.A3zbMATH Open1275.05006arXiv1301.6096MaRDI QIDQ376558FDOQ376558
Publication date: 5 November 2013
Published in: Journal of Combinatorics (Search for Journal in Brave)
Abstract: There are several versions of permutation pattern avoidance that have arisen in the literature, and some known examples of two different types of pattern avoidance coinciding. In this paper, we examine barred patterns and vincular patterns. Answering a question of Steingrimsson, we determine when barred pattern avoidance coincides with avoiding a finite set of vincular patterns, and when vincular pattern avoidance coincides with avoiding a finite set of barred patterns. There are 720 barred patterns with this property, each having between 3 and 7 letters, of which at most 2 are barred, and there are 48 vincular patterns with this property, each having between 2 and 4 letters and exactly one bond.
Full work available at URL: https://arxiv.org/abs/1301.6096
Recommendations
- Coincidence among families of mesh patterns
- Enumerations of permutations simultaneously avoiding a vincular and a covincular pattern of length 3
- Equivalence classes of mesh patterns with a dominating pattern
- Multi-avoidance of generalised patterns
- The absence of a pattern and the occurrences of another
permutationpatternpermutation pattern avoidancebarred patterngeneralized patternvincular pattern avoidance
Permutations, words, matrices (05A05) Graph theory (including graph drawing) in computer science (68R10) Combinatorics on words (68R15)
Cited In (12)
- DiscreteZOO: a fingerprint database of discrete objects
- Beyond alternating permutations: pattern avoidance in Young diagrams and tableaux
- Pattern-functions, statistics, and shallow permutations
- Distributions of several infinite families of mesh patterns
- Algorithmic coincidence classification of mesh patterns
- Reduced word manipulation: patterns and enumeration
- Equidistributions of mesh patterns of length two and Kitaev and Zhang's conjectures
- Distributions of mesh patterns of short lengths
- Lower bounds for superpatterns and universal sequences
- Mesh patterns with superfluous mesh
- \(k\)-pop stack sortable permutations and \(2\)-avoidance
- The most and the least avoided consecutive patterns
This page was built for publication: Coincidental pattern avoidance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q376558)