A simple proof for the exponential upper bound for some tenacious patterns

DOI10.1016/j.aam.2003.07.003zbMath1050.05005OpenAlexW2041026622MaRDI QIDQ1883399

Miklós Bóna

Publication date: 12 October 2004

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aam.2003.07.003

zbMATH Keywords

patternStanley-Wilf conjecture

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)

Related Items (5)

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 ⋮ Counting \(\mathbf {(3+1)}\)-avoiding permutations ⋮ On the Stanley--Wilf limit of 4231-avoiding permutations and a conjecture of Arratia

Cites Work

• The solution of a conjecture of Stanley and Wilf for all layered patterns
• Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
• Asymptotic values for degrees associated with strips of Young diagrams
• On the number of permutations avoiding a given pattern
• Unnamed Item

This page was built for publication: A simple proof for the exponential upper bound for some tenacious patterns