We study some combinatorial statistics defined on the set of monotonically ordered non-crossing partitions of {1,…,n}, and on the set of monotonically ordered non-crossing pair-partitions of {1,…,2n}. Unlike in the analogous results known for unordered non-crossing partitions, the computations of expectations and variances for natural block-counting statistics on and for the expectation of the area statistic on turn out to yield a logarithmic regime. An important role in our study is played by a nice tree structure on the disjoint union of the 's, which we use to streamline our arguments. As an illustration of how these ideas can be applied to calculations of cumulants in monotone probability, we discuss some combinatorial aspects of the monotonic Poisson process.

生成讲解博客的中文版本

生成AI智能校验的中文版本