Some set partition statistics in non-crossing partitions and generating functions (Q2463900)

This paper deals with set partitions \(\pi=\{B_1,B_2,\dots,B_k\}\) of \([n]=\{1,2,\dots,n\}\). The disjoint non-empty subsets \(B_i\) in \(\pi\) are called blocks. A block \(B\) is called singleton if \(|B|=1\). A partition \(\pi\) is called crossing if there are two blocks \(B_i\neq B_j\) in \(\pi\) and two pairs of elements \(b_1,b_2\in B_i, c_1,c_2\in B_j\) such that \(b_1<c_1<b_2<c_2\). If a partition is not a crossing one it is called non-crossing. The block \(B=\{b_1,\dots,b_{\mid B\mid}\}\) of a non-crossing partition \(\pi\) is said to be inner if there exists a block \(C=\{c_1,\dots,c_{\mid C\mid}\}\) of \(\pi\) such that \(c_1<b_1<c_{\mid C\mid}\). A block of a non-crossing partition is called outer if it is not inner. From the authors' abstract: In this paper we give the generating functions for the enumeration of non-crossing partitions according to some set partition statistics explicitly, which are based on whether a block is singleton or not and is inner or outer. Using weighted Motzkin paths, we find the continued fraction form of the generating functions. There are bijections between non-crossing partitions, Dyck paths and non-nesting partitons, hence we can find applications in the enumeration of Dyck paths and non-nesting partitions. We also study the integral representation of the enumerating polynomials for our statistics. As an application of integral representation, we give some remarks on the enumeration of inner singletons in non-crossing partitions, which is equivalent to one of the udu's at high level in Dyck paths.