Raised $k$-Dyck paths
Combinatorics
2022-06-03 v1
Abstract
Raised -Dyck paths are a generalization of -Dyck paths that may both begin and end at a nonzero height. In this paper, we develop closed formulas for the number of raised -Dyck paths from to for all height pairs , all lengths , and all . We then enumerate raised -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 for the -Catalan numbers) when closed formulas aren't tractable. Specializing our results to or to 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}
}