Abstract: Non-negative {L}ukasiewicz paths are special two-dimensional lattice paths never passing below their starting altitude which have only one single special type of down step. They are well-known and -studied combinatorial objects, in particular due to their bijective relation to trees with given node degrees. We study the asymptotic behavior of the number of ascents (i.e., the number of maximal sequences of consecutive up steps) of given length for classical subfamilies of general non-negative {L}ukasiewicz paths: those with arbitrary ending altitude, those ending on their starting altitude, and a variation thereof. Our results include precise asymptotic expansions for the expected number of such ascents as well as for the corresponding variance.
Recommendations
Cites work
Cited in
(14)- Enumerating symmetric and asymmetric peaks in Dyck paths
- Pattern statistics in faro words and permutations
- Analytic combinatorics of lattice paths with forbidden patterns, the vectorial kernel method, and generating functions for pushdown automata
- Fluctuations of random Motzkin paths
- scientific article; zbMATH DE number 6007736 (Why is no real title available?)
- Short note on the number of 1-ascents in dispersed Dyck paths
- Analysis of bidirectional ballot sequences and random walks ending in their maximum
- scientific article; zbMATH DE number 7406465 (Why is no real title available?)
- Ascending runs in permutations and valued Dyck paths
- scientific article; zbMATH DE number 6272293 (Why is no real title available?)
- Lattice Paths and Branched Continued Fractions: An Infinite Sequence of Generalizations of the Stieltjes–Rogers and Thron–Rogers Polynomials, with Coefficientwise Hankel-Total Positivity
- Enumeration of partial Łukasiewicz paths
- On generalized Dyck paths
- Dyck paths with coloured ascents
This page was built for publication: Counting ascents in generalized Dyck paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4993548)
