Statistics of blocks in \(k\)-divisible non-crossing partitions (Q456303)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6098334
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Statistics of blocks in \(k\)-divisible non-crossing partitions |
scientific article; zbMATH DE number 6098334 |
Statements
Statistics of blocks in \(k\)-divisible non-crossing partitions (English)
0 references
24 October 2012
0 references
Summary: We derive a formula for the expected number of blocks of a given size from a non-crossing partition chosen uniformly at random. Moreover, we refine this result subject to the restriction of having a number of blocks given.Furthermore, we generalize to \(k\)-divisible partitions. In particular, we find that, asymptotically, the expected number of blocks of size \(t\) of a \(k\)-divisible non-crossing partition of \(nk\) elements chosen uniformly at random is \(\frac{kn+1}{(k+1)^{t+1}}\). Similar results are obtained for type \(B\) and type \(D\) non-crossing partitions of \textit{D. Armstrong} [Mem. Am. Math. Soc. 202, No. 949, 1--159 (2009; Zbl 1191.05095)].
0 references
0.7732992768287659
0 references
0.7568788528442383
0 references
0.756338894367218
0 references
0.7350603938102722
0 references