An Elementary Proof of Bevan's Theorem on the Growth of Grid Classes of Permutations

DOI10.1017/S0013091519000026zbMath1422.05001arXiv1608.06967OpenAlexW2963986809MaRDI QIDQ5236939

Michael Henry Albert, Vincent R. Vatter

Publication date: 16 October 2019

Published in: Proceedings of the Edinburgh Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

growth ratessingular valuespermutation patternsgrid classes

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Asymptotic enumeration (05A16)

Related Items (2)

The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group ⋮ On the growth of merges and staircases of permutation classes

Cites Work

• Excluded permutation matrices and the Stanley-Wilf conjecture
• Forbidden subsequences
• On the growth of merges and staircases of permutation classes
• Permutation classes
• Small permutation classes
• On the Rearrangement Conjecture for Generalized Factor Order Over $\mathbb{P}$
• Growth rates of permutation classes: from countable to uncountable
• Growth rates of permutation grid classes, tours on graphs, and the spectral radius

This page was built for publication: An Elementary Proof of Bevan's Theorem on the Growth of Grid Classes of Permutations