Left to right maxima in Dyck Paths
Aubrey Blecher, Arnold Knopfmacher

TL;DR
This paper derives explicit generating functions for weak and strict left-to-right maxima in Dyck paths, using advanced analytic techniques to analyze their asymptotic behavior.
Contribution
It provides new explicit generating functions for these maxima in Dyck paths and applies sophisticated analytic methods for asymptotic analysis.
Findings
Explicit generating functions for weak and strict maxima in Dyck paths
Asymptotic formulas derived using Mellin transforms and singularity analysis
Analytic techniques applied to combinatorial structures
Abstract
In a Dyck path a peak which is (weakly) higher than all the preceding peaks is called a strict (weak) left to right maximum. We obtain explicit generating functions for both weak and strict left to right maxima in Dyck paths. The proofs of the associated asymptotics make use of analytic techniques such as Mellin transforms, singularity analysis and formal residue calculus.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Mathematics and Applications · Advanced Mathematical Theories and Applications
