arXiv Analytics

Sign in

arXiv:1704.07104 [math.CO]AbstractReferencesReviewsResources

Equivalence classes of mesh patterns with a dominating pattern

Murray Tannock, Henning Ulfarsson

Published 2017-04-24Version 1

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.

Related articles: Most relevant | Search more
arXiv:1005.5419 [math.CO] (Published 2010-05-29)
Equivalence classes of permutations avoiding a pattern
arXiv:1101.0410 [math.CO] (Published 2011-01-02)
Equivalence Classes of Full-Dimensional 0/1-Polytopes with Many Vertices
arXiv:1111.3920 [math.CO] (Published 2011-11-16)
Equivalence Classes of Permutations under Various Relations Generated by Constrained Transpositions