Packing sets of patterns
From MaRDI portal
Abstract: Packing density is a permutation occurrence statistic which describes the maximal number of permutations of a given type that can occur in another permutation. In this article we focus on containment of sets of permutations. Although this question has been tangentially considered previously, this is the first systematic study of it. We find the packing density for various special sets of permutations and study permutation and pattern co-occurrence.
Recommendations
Cites work
- A condensed condensation proof of a determinant evaluation conjectured by Greg Kuperberg and Jim Propp
- Bounding quantities related to the packing density of 1(+1) 2
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- On packing densities of permutations
- Optimal packing behavior of some 2-block patterns
- Packing densities of more 2-block patterns
- Packing densities of patterns
- Packing patterns into words
- Pattern frequency sequences and internal zeros
- Sorting Using Networks of Queues and Stacks
- The packing density of other layered permutations
Cited in
(14)- Packing patterns into words
- Packing densities of patterns
- Dense packing of patterns in a permutation
- Pattern formations and optimal packing
- Patterns in random permutations
- On packing densities of set partitions
- Waiting time distribution for the emergence of superpatterns
- Germ order for one-dimensional packings
- Pattern containment in circular permutations
- Packing patterns in symmetric words
- On packing densities of permutations
- Packing Density of Combinatorial Settlement Planning Models
- Moments of permutation statistics and central limit theorems
- Packing a binary pattern in compositions
This page was built for publication: Packing sets of patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1041198)