Crossings and nestings in colored set partitions
Eric Marberg

TL;DR
This paper generalizes the concepts of crossings and nestings in set partitions to r-colored set partitions, demonstrating symmetric distributions, establishing bijections with lattice paths, and proving P-recursiveness of certain enumeration sequences.
Contribution
It introduces the notion of r-colored set partitions with colored arcs, extending symmetry results and establishing bijections with paths, along with proving P-recursiveness of related counting sequences.
Findings
Largest crossings and nestings have symmetric joint distribution in colored set partitions.
r-colored noncrossing set partitions correspond to paths in ^r, generalizing known bijections.
The sequence counting noncrossing 2-colored set partitions is P-recursive.
Abstract
Chen, Deng, Du, Stanley, and Yan introduced the notion of -crossings and -nestings for set partitions, and proved that the sizes of the largest -crossings and -nestings in the partitions of an -set possess a symmetric joint distribution. This work considers a generalization of these results to set partitions whose arcs are labeled by an -element set (which we call \emph{-colored set partitions}). In this context, a -crossing or -nesting is a sequence of arcs, all with the same color, which form a -crossing or -nesting in the usual sense. After showing that the sizes of the largest crossings and nestings in colored set partitions likewise have a symmetric joint distribution, we consider several related enumeration problems. We prove that -colored set partitions with no crossing arcs of the same color are in bijection with certain paths in ,…
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.
