On the Stanley--Wilf limit of 4231-avoiding permutations and a conjecture of Arratia
From MaRDI portal
Publication:2490021
DOI10.1016/j.aam.2005.05.007zbMath1089.05002arXivmath/0502504OpenAlexW2143645603WikidataQ123241645 ScholiaQ123241645MaRDI QIDQ2490021
P. Westcott, Murray J. Elder, Andrew Rechnitzer, Michael Henry Albert, Michael Zabrocki
Publication date: 28 April 2006
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0502504
Related Items (15)
Locally convex words and permutations ⋮ New records in Stanley-Wilf limits ⋮ A New Upper Bound for 1324-Avoiding Permutations ⋮ Permutations avoiding 1324 and patterns in Łukasiewicz paths ⋮ Using functional equations to enumerate 1324-avoiding permutations ⋮ A structural characterisation of \(\mathrm{Av}(1324)\) and new bounds on its growth rate ⋮ Staircases, dominoes, and the growth rate of 1324-avoiders ⋮ Pattern avoidance in matchings and partitions ⋮ Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns ⋮ Counting \(\mathbf {(3+1)}\)-avoiding permutations ⋮ Large Deviations and Ratio Limit Theorems for Pattern-Avoiding Permutations ⋮ On \(1324\)-avoiding permutations ⋮ On constants in the Füredi-Hajnal and the Stanley-Wilf conjecture ⋮ On Stanley-Wilf limit of the pattern 1324 ⋮ Permutations generated by a depth 2 stack and an infinite stack in series are algebraic
Uses Software
Cites Work
- Unnamed Item
- The limit of a Stanley-Wilf sequence is not always rational, and layered patterns beat monotone patterns
- Excluded permutation matrices and the Stanley-Wilf conjecture
- The number of Baxter permutations
- On the Stanley-Wilf conjecture for the number of permutations avoiding a given pattern
- Enumeration schemes and, more importantly, their automatic generation
- Permutations avoiding certain patterns: The case of length 4 and some generalizations
- Counting 1324-avoiding permutations
- Asymptotic values for degrees associated with strips of Young diagrams
- On growth rates of closed permutation classes
- A simple proof for the exponential upper bound for some tenacious patterns
- From object grammars to ECO systems
- Restricted permutations and queue jumping
- Exhaustive generation of combinatorial objects by ECO
- The insertion encoding of permutations
- ECO:a methodology for the enumeration of combinatorial objects
This page was built for publication: On the Stanley--Wilf limit of 4231-avoiding permutations and a conjecture of Arratia