On Packing Densities of Set Partitions
Adam M. Goyt, Lara K. Pudwell

TL;DR
This paper investigates the packing densities of set partitions, extending known results from permutations and words, and determines the packing density for a specific set partition.
Contribution
It generalizes packing density results to set partitions and computes the density for a particular partition not previously analyzed.
Findings
Provides packing densities for most partitions of {1,2,3}
Determines the packing density of the partition {{1,3},{2}}
Extends permutation and word packing density results to set partitions
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 . In the final section we determine the packing density of the set partition .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · semigroups and automata theory · Advanced Mathematical Identities
