The ascent lattice on Dyck paths
Jean-Luc Baril, Mireille Bousquet-M\'elou, Sergey Kirgizov, Mehdi Naima

TL;DR
This paper introduces and analyzes the ascent lattice on Dyck paths, revealing its algebraic structure, counting intervals, and exploring its properties and connections with walks, congruences, and asymptotic behavior.
Contribution
It defines the ascent lattice on Dyck paths, proves it forms a lattice, and derives algebraic generating functions for counting intervals, extending to generalized Dyck paths and exploring their properties.
Findings
The ascent lattice is a lattice structure on Dyck paths.
The generating function for intervals in the ascent lattice is algebraic of degree 3.
Interval enumeration in generalized Dyck path posets involves complex equations and asymptotic analysis.
Abstract
In the Stanley lattice defined on Dyck paths of size , cover relations are obtained by replacing a valley by a peak . We investigate a greedy version of this lattice, first introduced by Chenevi\`ere, where cover relations replace a factor by . By relating this poset to another poset recently defined by Nadeau and Tewari, we prove that this still yields a lattice, which we call the ascent lattice, . We then count intervals in . Their generating function is found to be algebraic of degree . The proof is based on a recursive decomposition of intervals involving two catalytic parameters. The solution of the corresponding functional equation is inspired by recent work on the enumeration of walks confined to a quadrant. We also consider the order induced in on -Dyck paths, that is, paths in which all ascent lengths are multiples of ,…
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.
