Ascents of size less than \(d\) in compositions (Q632273): Difference between revisions

Let \(n = p_1+\dots+p_k\) a composition of \(n\): An ascent of size \(\geq d\) (or \(< d\), respectively) in this composition is an index \(i\) with \(p_{i+1}\geq p_i+d\) (or \(p_i<p_{i+1}<p_i+d\), respectively), a descent is an index \(i\) with \(p_i>p_{i+1}\), and a level is an index \(i\) with \(p_i=p_{i+1}\). The authors present the multi--variable generating function of compositions counted by their sum (\(n\)) and their numbers of parts, of ascents \(\geq d\), of ascents \(< d\), of descents, and of levels. Moreover, they determine the limiting distribution of the number of ascents \(< d\).