Enumeration of Generalized Dyck Paths Based on the Height of Down-Steps Modulo k

DOI10.37236/11218MaRDI QIDQ6397785arXivFDO

Authors Clemens Heuberger, Sarah J. Selkirk, Stephan Wagner

Publication date 29 April 2022

Published in arXiv

Full work available at URL https://doi.org/10.37236/11218

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Symmetric functions and generalizations (05E05)

arXiv classification

math.CO

Abstract: For fixed non-negative integers $k$, $t$, and $n$, with $t<k$, a $k_t$-Dyck path of length $(k+1)n$ is a lattice path that starts at $(0,0)$, ends at $((k+1)n,0)$, stays weakly above the line $y=-t$, and consists of steps from the step-set $(1,1),(1,-k)$. We enumerate the family of $k_t$-Dyck paths by considering the number of down-steps at a height of $i$ modulo $k$. Given a tuple $(a_1,a_2,ldots,a_k)$ we find an exact enumeration formula for the number of $k_t$-Dyck paths of length $(k+1)n$ with $a_i$ down-steps at a height of $i$ modulo $k$, $1leqileqk$. The proofs given are done via bijective means or with generating functions.

This page was built for publication: Enumeration of Generalized Dyck Paths Based on the Height of Down-Steps Modulo $k$

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6397785)