A new record for 1324-avoiding permutations
From MaRDI portal
Publication:2340972
DOI10.1007/S40879-014-0020-6zbMATH Open1310.05007arXiv1404.4033OpenAlexW1973850674MaRDI QIDQ2340972FDOQ2340972
Publication date: 21 April 2015
Published in: European Journal of Mathematics (Search for Journal in Brave)
Abstract: Refining an existing counting argument, we provide an improved upper bound for the number of 1324-avoiding permutations of a given length.
Full work available at URL: https://arxiv.org/abs/1404.4033
Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Asymptotic enumeration (05A16) Enumeration in graph theory (05C30)
Cites Work
- Combinatorics of permutations
- On the Stanley-Wilf conjecture for the number of permutations avoiding a given pattern
- Excluded permutation matrices and the Stanley-Wilf conjecture
- Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns
- A New Upper Bound for 1324-Avoiding Permutations
- Permutations avoiding 1324 and patterns in Łukasiewicz paths
Cited In (10)
- On the likelihood of single-peaked preferences
- Generalized coloring of permutations
- Generalized Coloring of Permutations
- On \(1324\)-avoiding 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)
