2000 character limit reached
Some Wilf-equivalences for vincular patterns
Published 27 Sep 2013 in math.CO | (1309.7111v2)
Abstract: We prove several Wilf-equivalences for vincular patterns of length 4, some of which generalize to infinite families of vincular patterns. We also present functional equations for the generating functions for the number of permutations of length n avoiding a single pattern for the patterns 124-3, 134-2, 231-4, 241-3, 132-4, and 142-3. This nearly completes the Wilf-classification of vincular patterns of length 4. As a corollary, these results imply Wilf-equivalences for certain barred patterns of length 5 with a single bar.
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.