A New Upper Bound for 1324-Avoiding Permutations

DOI10.1017/S0963548314000091zbMath1298.05019arXiv1207.2379MaRDI QIDQ3191197

Miklós Bóna

Publication date: 24 September 2014

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

zbMATH Keywords

pattern avoiding permutationsshortest pattern

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Combinatorial inequalities (05A20) Asymptotic enumeration (05A16)

Related Items

Unsplittable classes of separable permutations, 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, Generalized Coloring of Permutations, On the growth of merges and staircases of permutation classes, On Stanley-Wilf limit of the pattern 1324, A new record for \(1324\)-avoiding permutations

Cites Work

• Unnamed Item
• Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns
• Excluded permutation matrices and the Stanley-Wilf conjecture
• New records in Stanley-Wilf limits
• On the Stanley--Wilf limit of 4231-avoiding permutations and a conjecture of Arratia
• Restricted permutations