Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns

Abstract

We prove that the Stanley-Wilf limit of any layered permutation pattern of length $\ell$ is at most $4{\ell }^2$, and that the Stanley-Wilf limit of the pattern 1324 is at most 16. These bounds follow from a more general result showing that a permutation avoiding a pattern of a special form is a merge of two permutations, each of which avoids a smaller pattern. If the conjecture is true that the maximum Stanley-Wilf limit for patterns of length $\ell$ is attained by a layered pattern then this implies an upper bound of $4{\ell }^2$ for the Stanley-Wilf limit of any pattern of length $\ell$. We also conjecture that, for any $k\ge 0$, the set of 1324-avoiding permutations with $k$ inversions contains at least as many permutations of length $n+1$ as those of length $n$. We show that if this is true then the Stanley-Wilf limit for 1324 is at most $e^{\pi \sqrt{2/3}}\simeq 13.001954$.

References in corpus (1)

• Growth rates for subclasses of Av(321)

Cited by in corpus (18)

• A new upper bound for 1324-avoiding permutations
• Pattern-Avoiding Involutions: Exact and Asymptotic Enumeration
• Permutations avoiding 1324 and patterns in Łukasiewicz paths
• Approaches for enumerating permutations with a prescribed number of occurrences of patterns
• On the growth rate of 1324-avoiding permutations
• Pattern avoidance in matchings and partitions
• Pattern Avoidance for Random Permutations
• On the Best Upper Bound for Permutations Avoiding A Pattern of a Given Length
• Descent sets on 321-avoiding involutions and hook decompositions of partitions
• A new record for $1324$-avoiding permutations
• Interval minors of complete multipartite graphs
• Patterns in Permutations and Involutions: A Structural and Enumerative Approach
• Interval minors of complete bipartite graphs
• Composable Constraint Models for Permutation Enumeration
• Restricted Permutations Enumerated by Inversions
• The Relation between Composability and Splittability of Permutation Classes
• On the centrosymmetric permutations in a class
• Splittability and 1-amalgamability of permutation classes