A new record for 1324-avoiding permutations

DOI10.1007/S40879-014-0020-6MaRDI QIDQ2340972zbMATH OpenOpenAlexFDO

Authors Miklós Bóna

Publication date 21 April 2015

Published in European Journal of Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

permutationswordsenumerationupper boundpatterns

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Asymptotic enumeration (05A16) Enumeration in graph theory (05C30)

Abstract: Refining an existing counting argument, we provide an improved upper bound for the number of 1324-avoiding permutations of a given length.

Cites work

• A new upper bound for 1324-avoiding permutations
• Combinatorics of permutations
• Excluded permutation matrices and the Stanley-Wilf conjecture
• On the Stanley-Wilf conjecture for the number of permutations avoiding a given pattern
• Permutations avoiding 1324 and patterns in Łukasiewicz paths
• Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns

Cited in

(10)

• On the likelihood of single-peaked preferences
• Generalized coloring of permutations
• On \(1324\)-avoiding permutations
• Generalized Coloring of Permutations
• On pattern avoiding indecomposable permutations
• Schwarzian conditions for linear differential operators with selected differential Galois groups
• Permutations avoiding 1324 and patterns in Łukasiewicz paths
• Staircases, dominoes, and the growth rate of 1324-avoiders
• On the growth of merges and staircases of permutation classes
• A structural characterisation of \(\mathrm{Av}(1324)\) and new bounds on its growth rate

This page was built for publication: A new record for \(1324\)-avoiding permutations

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