Central Limit Theorems for some Set Partition Statistics
Abstract
We prove the conjectured limiting normality for the number of crossings of a uniformly chosen set partition of [n] = 1,2,...,n. The arguments use a novel stochastic representation and are also used to prove central limit theorems for the dimension index and the number of levels.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.