On \({k}\)-Dyck Paths with a Negative Boundary
Helmut Prodinger · Journal of Combinatorial Mathematics and Combinatorial Computing · 2024
Paths that consist of up-steps of one unit and down-steps of \(k\) units, being bounded below by a horizontal line \(-t\), behave like \(t+1\) ordered tuples of \(k\)-Dyck paths, provided that \(t\le k\). We describe the general case, allowing \(t\) also to be larger. Arguments are bijective and/or analytic.