English

Left to right maxima in Dyck Paths

Combinatorics 2021-07-08 v1

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.

Keywords

Cite

@article{arxiv.2107.03102,
  title  = {Left to right maxima in Dyck Paths},
  author = {Aubrey Blecher and Arnold Knopfmacher},
  journal= {arXiv preprint arXiv:2107.03102},
  year   = {2021}
}
R2 v1 2026-06-24T03:57:37.094Z