pith. sign in

arxiv: 1201.6576 · v3 · pith:LLI2XATInew · submitted 2012-01-31 · 🧮 math.CO

Statistics of blocks in k-divisible non-crossing partitions

classification 🧮 math.CO
keywords blocksk-divisiblenon-crossingnumberpartitionschosenexpectedgiven
0
0 comments X
read the original abstract

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 (kn+1)/(k+1)^(t+1). Similar results are obtained for type B and type D k-divisible non-crossing partitions of Armstrong.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.