Left to right maxima in Dyck prefixes
DOI:
https://doi.org/10.13069/jacodesmath.v11i1.248Keywords:
Dyck prefixes, Generating functions, AsymptoticAbstract
In a Dyck path, a peak which is strictly (weakly) higher than all the preceding peaks is called a strict (weak) left-to-right maximum. By dropping the restrictions for the path to end on the $x$-axis, one obtains Dyck prefixes. We obtain explicit generating functions for both weak and strict left-to-right maxima in Dyck prefixes. The proofs of the associated asymptotics make use of analytic techniques such as Mellin transforms, singularity analysis and formal residue calculus.
Received: 26 April 2022 | Accepted: 28 June 2023Downloads
Download data is not yet available.
Downloads
Published
2023-10-06
How to Cite
Knopfmacher, A. ., & Blecher, A. (2023). Left to right maxima in Dyck prefixes. Journal of Algebra Combinatorics Discrete Structures and Applications, 11(1), 1–13. https://doi.org/10.13069/jacodesmath.v11i1.248
Issue
Section
Articles