2000 character limit reached
Equivalence classes of mesh patterns with a dominating pattern
Published 24 Apr 2017 in math.CO | (1704.07104v4)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.