On the growth of merges and staircases of permutation classes

DOI10.1216/RMJ-2019-49-2-355zbMath1418.05015arXiv1608.06969OpenAlexW2963162444WikidataQ127627950 ScholiaQ127627950MaRDI QIDQ2002496

Vincent R. Vatter, Jay Pantone, Michael Henry Albert

Publication date: 12 July 2019

Published in: Rocky Mountain Journal of Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

permutation patternsexponential growth ratestaircase classes

Mathematics Subject Classification ID

Asymptotic enumeration (05A16)

Related Items (7)

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 ⋮ Generalized Coloring of Permutations ⋮ Unnamed Item ⋮ An Elementary Proof of Bevan's Theorem on the Growth of Grid Classes of Permutations ⋮ Permutations avoiding sets of patterns with long monotone subsequences

Cites Work

• Unnamed Item
• Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns
• Splittings and Ramsey properties of permutation classes
• 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
• New records in Stanley-Wilf limits
• On the Stanley-Wilf conjecture for the number of permutations avoiding a given pattern
• Forbidden subsequences
• Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
• Staircases, dominoes, and the growth rate of 1324-avoiders
• Asymptotic values for degrees associated with strips of Young diagrams
• A new record for \(1324\)-avoiding permutations
• The insertion encoding of permutations
• A New Upper Bound for 1324-Avoiding Permutations
• An Elementary Proof of Bevan's Theorem on the Growth of Grid Classes of Permutations
• Growth rates of permutation grid classes, tours on graphs, and the spectral radius
• On the length of the longest subsequence avoiding an arbitrary pattern in a random permutation
• Restricted permutations

This page was built for publication: On the growth of merges and staircases of permutation classes