Equivalence classes of mesh patterns with a dominating pattern
From MaRDI portal
Abstract: Two mesh patterns are coincident if they are avoided by the same set of permutations, and are Wilf-equivalent if they have the same number of avoiders of each length. We provide sufficient conditions for coincidence of mesh patterns, when only permutations also avoiding a longer classical pattern are considered. Using these conditions we completely classify coincidences between families containing a mesh pattern of length 2 and a classical pattern of length 3. Furthermore, we completely Wilf-classify mesh patterns of length 2 inside the class of 231-avoiding permutations.
Recommendations
Cited in
(12)- Equidistributions of mesh patterns of length two and Kitaev and Zhang's conjectures
- Asymptotic behaviour of the containment of certain mesh patterns
- The poset of mesh patterns
- Distributions of several infinite families of mesh patterns
- Resolving two conjectures on staircase encodings and boundary grids of \(132\) and \(123\)-avoiding permutations
- Equidistributions of mesh patterns of length two
- Coincidence among families of mesh patterns
- Coincidental pattern avoidance
- Enumeration and Wilf-classification of permutations avoiding four patterns of length 4
- Algorithmic coincidence classification of mesh patterns
- Mesh patterns with superfluous mesh
- Wilf-classification of mesh patterns of short length
This page was built for publication: Equivalence classes of mesh patterns with a dominating pattern
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4560188)
