Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Algebra Combinatorics Discrete Structures and Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
