Summary: The density of a permutation pattern \(\pi\) in a permutation \(\sigma\) is the proportion of subsequences of \(\sigma\) of length \(|\pi|\) that are isomorphic to \(\pi\). The maximal value of the density is found for several patterns \(\pi\), and asymptotic upper and lower bounds for the maximal density are found in several other cases. The results are generalised to sets of patterns and the maximum density is found for all sets of length \(3\) patterns.
Recommendations
Cited in
(30)- Determining lower bounds for packing densities of non-layered patterns using weighted templates
- Packing sets of patterns
- Packing densities of patterns
- An answer to a question by Wilf on packing distinct patterns in a permutation
- Independence of permutation limits at infinitely many scales
- Density maximizers of layered permutations
- The feasible regions for consecutive patterns of pattern-avoiding permutations
- Prolific permutations and permuted packings: downsets containing many large patterns
- Permutations containing many patterns
- Dense packing of patterns in a permutation
- Packing densities of more 2-block patterns
- Patterns in random permutations
- Colored patterns and their packing densities
- On packing densities of set partitions
- Note on packing patterns in colored permutations
- Packing densities of layered permutations and the minimum number of monotone sequences in layered permutations
- Waiting time distribution for the emergence of superpatterns
- Packing rates of measures and a conjecture for the packing density of 2413
- Improving bounds on packing densities of 4-point permutations
- Asymptotics of principal evaluations of Schubert polynomials for layered permutations
- Permutations with fixed pattern densities
- Minimum Number of Monotone Subsequences of Length 4 in Permutations
- Pattern containment in circular permutations
- Counting fixed-length permutation patterns
- Packing patterns in symmetric words
- On the densities of cliques and independent sets in graphs
- Packing a binary pattern in compositions
- Repeatable patterns and the maximum multiplicity of a generator in a reduced word
- How balanced can permutations be?
- Bounding quantities related to the packing density of 1(+1) 2
This page was built for publication: On packing densities of permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5954958)
