A new upper bound for 1324-avoiding permutations

DOI10.1017/S0963548314000091MaRDI QIDQ3191197zbMATH OpenFDO

Authors 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

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

Abstract: We prove that the number of 1324-avoiding permutations of length n is less than (7+4sqrt{3})^n.

Recommendations

• On \(1324\)-avoiding permutations
• Counting 1324-avoiding permutations
• Permutations avoiding certain patterns: The case of length 4 and some generalizations
• An upper bound on the number of \((132, 213)\)-avoiding cyclic permutations
• 1324-avoiding permutations revisited

Cites work

• Analytic combinatorics
• 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
• Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns

Cited in

(15)

• Staircases, dominoes, and the growth rate of 1324-avoiders
• An upper bound on the number of \((132, 213)\)-avoiding cyclic permutations
• On the growth of merges and staircases of permutation classes
• On a family of conjectures of Joel Lewis on alternating permutations
• On Stanley-Wilf limit of the pattern 1324
• A structural characterisation of \(\mathrm{Av}(1324)\) and new bounds on its growth rate
• Pattern avoiding permutations and independent sets in graphs
• A new record for \(1324\)-avoiding permutations
• Unsplittable classes of separable permutations
• Permutations avoiding 1324 and patterns in Łukasiewicz paths
• Using functional equations to enumerate 1324-avoiding permutations
• Generalized Coloring of Permutations
• Generalized coloring of permutations
• Combinatorial exploration: an algorithmic framework for enumeration
• Enumerating 1324-avoiders with few inversions

This page was built for publication: A new upper bound for 1324-avoiding permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3191197)