Skip to main content
Central limit theorems for some set partition statistics
Published Web Location
http://cseweb.ucsd.edu/~dakane/setPartCentralLimit.pdfNo data is associated with this publication.
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.
Many UC-authored scholarly publications are freely available on this site because of the UC's open access policies. Let us know how this access is important for you.