Statistics on monotonically ordered non-crossing partitions

Abstract

We study some combinatorial statistics defined on the set NC(mton)(n) of monotonically ordered non-crossing partitions of 1,...,n, and on the set NC2(mton)(2n) 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 NC(mton)(n) and for the expectation of the area statistic on NC2(mton)(2n) 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 NC(mton)(n)'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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…