The limit of a Stanley-Wilf sequence is not always rational, and layered patterns beat monotone patterns

DOI10.1016/j.jcta.2004.07.014zbMath1067.05003arXivmath/0403502OpenAlexW2105493981MaRDI QIDQ556857

Miklós Bóna

Publication date: 23 June 2005

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0403502

zbMATH Keywords

permutationpattern

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Related Items (10)

New records in Stanley-Wilf limits ⋮ Classical length-5 pattern-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 ⋮ Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns ⋮ On the growth of merges and staircases of permutation classes ⋮ On the Stanley--Wilf limit of 4231-avoiding permutations and a conjecture of Arratia ⋮ Asymptotic enumeration of permutations avoiding generalized patterns ⋮ Where the monotone pattern (mostly) rules ⋮ Permutations avoiding sets of patterns with long monotone subsequences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Excluded permutation matrices and the Stanley-Wilf conjecture
• On the Stanley-Wilf conjecture for the number of permutations avoiding a given pattern
• Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
• Permutations avoiding certain patterns: The case of length 4 and some generalizations
• Asymptotic values for degrees associated with strips of Young diagrams
• On growth rates of closed permutation classes
• Wilf-equivalence for singleton classes
• Restricted permutations

This page was built for publication: The limit of a Stanley-Wilf sequence is not always rational, and layered patterns beat monotone patterns