Permutations avoiding 1324 and patterns in Łukasiewicz paths
From MaRDI portal
Abstract: The class Av(1324), of permutations avoiding the pattern 1324, is one of the simplest sets of combinatorial objects to define that has, thus far, failed to reveal its enumerative secrets. By considering certain large subsets of the class, which consist of permutations with a particularly regular structure, we prove that the growth rate of the class exceeds 9.81. This improves on a previous lower bound of 9.47. Central to our proof is an examination of the asymptotic distributions of certain substructures in the Hasse graphs of the permutations. In this context, we consider occurrences of patterns in {L}ukasiewicz paths and prove that in the limit they exhibit a concentrated Gaussian distribution.
Recommendations
- On \(1324\)-avoiding permutations
- A relation on 132-avoiding permutation patterns
- Patterns in random permutations avoiding the pattern 132
- scientific article; zbMATH DE number 1375582
- 1324-avoiding permutations revisited
- Permutation pattern matching in (213,231)-avoiding permutations
- On the diagram of 132-avoiding permutations
- A new record for \(1324\)-avoiding permutations
- Lattice paths and pattern-avoiding uniquely sorted permutations
- A new upper bound for 1324-avoiding permutations
Cites work
- A new record for \(1324\)-avoiding permutations
- Analytic combinatorics
- Excluded permutation matrices and the Stanley-Wilf conjecture
- Forest-like permutations
- scientific article; zbMATH DE number 5831716 (Why is no real title available?)
- scientific article; zbMATH DE number 41707 (Why is no real title available?)
- Large deviations and ratio limit theorems for pattern-avoiding permutations
- On \(1324\)-avoiding permutations
- On the Stanley--Wilf limit of 4231-avoiding permutations and a conjecture of Arratia
- Some open problems on permutation patterns
- String overlaps, pattern matching, and nontransitive games
- Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns
- Using functional equations to enumerate 1324-avoiding permutations
Cited in
(20)- Shape-Wilf-ordering on permutations of length 3
- Permutations avoiding certain patterns: The case of length 4 and some generalizations
- Staircases, dominoes, and the growth rate of 1324-avoiders
- On Stanley-Wilf limit of the pattern 1324
- A structural characterisation of \(\mathrm{Av}(1324)\) and new bounds on its growth rate
- On \(1324\)-avoiding permutations
- Analytic combinatorics of lattice paths with forbidden patterns, the vectorial kernel method, and generating functions for pushdown automata
- A new record for \(1324\)-avoiding permutations
- Longest monotone subsequences and rare regions of pattern-avoiding permutations
- 1324-avoiding permutations revisited
- Wilf classes of pairs of permutations of length 4
- Egge triples and unbalanced Wilf equivalence
- Some open problems on permutation patterns
- On avoidance of V- and -patterns in permutations.
- The permutation class Av(4213,2143)
- Counting ascents in generalized Dyck paths
- On pattern avoiding indecomposable permutations
- The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group
- Combinatorial exploration: an algorithmic framework for enumeration
- Enumerating 1324-avoiders with few inversions
This page was built for publication: Permutations avoiding 1324 and patterns in Łukasiewicz paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2947126)
