Packing densities of patterns
From MaRDI portal
Summary: The packing density of a permutation \(\pi\) of length \(n\) is the maximum proportion of subsequences of length \(n\) which are order-isomorphic to \(\pi\) in arbitrarily long permutations \(\sigma\). For the generalization to patterns \(\pi\) which may have repeated letters, two notions of packing density have been defined. In this paper, we show that these two definitions are equivalent, and we compute the packing density for new classes of patterns.
Recommendations
Cited in
(23)- Determining lower bounds for packing densities of non-layered patterns using weighted templates
- Packing sets of patterns
- Patterns and structures in disk packings
- Packing patterns into words
- An answer to a question by Wilf on packing distinct patterns in a permutation
- Optimal packing behavior of some 2-block patterns
- Non-uniform packings
- Independence of permutation limits at infinitely many scales
- Density maximizers of layered permutations
- The feasible regions for consecutive patterns of pattern-avoiding permutations
- Dense packing of patterns in a permutation
- Packing densities of more 2-block patterns
- Pattern formations and optimal packing
- Colored patterns and their packing densities
- On packing densities of set partitions
- Note on packing patterns in colored permutations
- Waiting time distribution for the emergence of superpatterns
- Packing rates of measures and a conjecture for the packing density of 2413
- From permutation patterns to the periodic table
- SOME DENSE RANDOM PACKINGS GENERATED BY THE DEAD LEAVES MODEL
- Packing patterns in symmetric words
- On packing densities of permutations
- Packing a binary pattern in compositions
This page was built for publication: Packing densities of patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1773169)