Set partition patterns and statistics

A set partition σ of [n] = {1, . . . , n} contains another set partition π if restricting σ to some S ⊆ [n] and then standardizing the result gives π. Otherwise we say σ avoids π. For all sets of patterns consisting of partitions of [3], the sizes of the avoidance classes were determined by Sagan and by Goyt. Set partitions are in bijection with restricted growth functions (RGFs) for which Wachs and White defined four fundamental statistics. We consider the distributions of these statistics over various avoidance classes, thus obtaining multivariate analogues of the previously cited cardinality results. This is the first in-depth study of such distributions. We end with a list of open problems. ∗ All authors’ research partially supported by NSA grant H98230-13-1-0259, by NSF grant DMS-1062817, and by the SURIEM REU at Michigan State University 1 

• Type: Journal
• Year: 2016
• Where: DM
• Authors: Samantha Dahlberg, Robert Dorward, Jonathan Gerhard, Thomas Grubb, Carlin Purcell, Lindsey Reppuhn, Bruce E. Sagan
• Keywords: DM 2016