
TL;DR
This paper introduces colored set partitions of type $B_n$, deriving formulas for their enumeration, statistical properties, and proving asymptotic normality of the number of non-zero blocks.
Contribution
It generalizes Reiner's type $B_n$ partitions by coloring elements and provides exact and asymptotic formulas for their enumeration and statistical behavior.
Findings
Exact formulas for expectation and variance of non-zero blocks.
Asymptotic expression for total number of colored $B_n$-partitions.
Proof of asymptotic normality of the number of non-zero blocks.
Abstract
Generalizing Reiner's notion of set partitions of type , we define colored -partitions by coloring the elements in and not in the zero-block respectively. Considering the generating function of colored -partitions, we get the exact formulas for the expectation and variance of the number of non-zero-blocks in a random colored -partition. We find an asymptotic expression of the total number of colored -partitions up to an error of , and prove that the centralized and normalized number of non-zero-blocks is asymptotic normal over colored -partitions.
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.
