Adam M. Goyt, Lara K. Pudwell
Published 2013-01-07, updated 2015-04-09Version 2
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\}\}$.
Comments: 12 pages, to appear in the Permutation Patterns edition of the Australasian Journal of Combinatorics
Pattern Avoidance in Set Partitions
On the set partitions that require maximum sorts through the $aba-$avoiding stack
Packing sets of patterns
![QR code for arXiv:1301.1303 [math.CO]](http://oss.arxitics.com/images/favicon.svg)