A new upper bound for 1324-avoiding permutations

Abstract

We prove that the number of 1324-avoiding permutations of length n is less than (7+4\sqrt{3})^n.

6 pages

References in corpus (1)

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

Cited by in corpus (8)

• Pattern-Avoiding Involutions: Exact and Asymptotic Enumeration
• Approaches for enumerating permutations with a prescribed number of occurrences of patterns
• 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
• Enumeration of polyominoes defined in terms of pattern avoidance or convexity constraints
• A new record for $1324$-avoiding permutations
• Patterns in Permutations and Involutions: A Structural and Enumerative Approach