Ascents of size less than d in compositions
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\).
- Analytic combinatorics
- Combinatorics of Compositions and Words
- scientific article; zbMATH DE number 3821741 (Why is no real title available?)
- scientific article; zbMATH DE number 3528241 (Why is no real title available?)
- scientific article; zbMATH DE number 2214409 (Why is no real title available?)
- Level number sequences for trees
- On Carlitz compositions
- The distribution of ascents of size d or more in compositions
- The first ascent of size d or more in compositions
- The distribution of ascents of size d or more in compositions
- Longest run of equal parts in a random integer composition
- scientific article; zbMATH DE number 6291261 (Why is no real title available?)
- scientific article; zbMATH DE number 7674537 (Why is no real title available?)
- Greatest descents after any maxima in compositions
This page was built for publication: Ascents of size less than \(d\) in compositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q632273)
