Set partitions with successions and separations (Q2566597): Difference between revisions

Consider the set of all partitions of the \(m\)-element set \(\{1,2,\dots,m\}\) into \(k\) nonempty and disjoint subsets (blocks). A succession of a partition is a pair of consecutive integers, where each such pair is counted within one block and strings of more than two consecutive integers in a block are considered as two at a time. Let \(c_r(m,k)\) be the number of such partitions having \(r\geq 0\) successions. Successions are called detached if they do not contain more than two consecutive integers. Let \(d_r(m,k)\) be the number of partitions with \(r\) detached successions. In the present paper the author obtains recurrence relations and exact enumeration formulas for \(c_r(m,k)\), \(d_r(m,k)\), \(e_r(m,k)=c_r(m,k)-d_r(m,k)\), \(c_r(m)=\sum_{k=1}^m c_r(m,k)\), \(d_r(m)=\sum_{k=1}^m d_r(m,k)\) and \(e_r(m)=\sum_{k=1}^m e_r(m,k)\). Some of his results express these numbers in terms of Stirling numbers of the second kind and of Bell numbers.