On Packing Densities of Set Partitions
Preprint
Abstract
We study packing densities for set partitions, which is a generalization of packing words. We use results from the literature about packing densities for permutations and words to provide packing densities for set partitions. These results give us most of the packing densities for partitions of the set $\{1,2,3\}$. In the final section we determine the packing density of the set partition $\{\{1,3\},\{2\}\}$.
Keywords
All Related Versions
This publication has 8 references indexed in Scilit:
- Packing densities of more 2-block patternsAdvances in Applied Mathematics, 2006
- Optimal Packing Behavior of Some 2-Block PatternsAnnals of Combinatorics, 2004
- Packing Densities of PatternsThe Electronic Journal of Combinatorics, 2004
- Packing Patterns into WordsThe Electronic Journal of Combinatorics, 2002
- On Packing Densities of PermutationsThe Electronic Journal of Combinatorics, 2002
- Counting Pattern-free Set Partitions I: A Generalization of Stirling Numbers of the Second KindEuropean Journal of Combinatorics, 2000
- Counting Pattern-free Set Partitions II: Noncrossing and Other HypergraphsThe Electronic Journal of Combinatorics, 2000
- On abab-free and abba-free Set PartitionsEuropean Journal of Combinatorics, 1996