English

Raised $k$-Dyck paths

Combinatorics 2022-06-03 v1

Abstract

Raised kk-Dyck paths are a generalization of kk-Dyck paths that may both begin and end at a nonzero height. In this paper, we develop closed formulas for the number of raised kk-Dyck paths from (0,α)(0,\alpha) to (,β)(\ell,\beta) for all height pairs α,β0\alpha,\beta \geq 0, all lengths 0\ell \geq 0, and all k2k \geq 2. We then enumerate raised kk-Dyck paths with a fixed number of returns to ground, a fixed minimum height, and a fixed maximum height, presenting generating functions (in terms of the generating functions Ck(t)C_k(t) for the kk-Catalan numbers) when closed formulas aren't tractable. Specializing our results to k=2k=2 or to α<k\alpha < k reveal connections with preexisting results concerning height-bounded Dyck paths and "Dyck paths with a negative boundary", respectively.

Keywords

Cite

@article{arxiv.2206.01194,
  title  = {Raised $k$-Dyck paths},
  author = {Paul Drube},
  journal= {arXiv preprint arXiv:2206.01194},
  year   = {2022}
}
R2 v1 2026-06-24T11:37:30.846Z