MIN-turns and MAX-turns in k-Dyck paths: a pure generating function approach
Combinatorics
2023-09-04 v3
Abstract
-Dyck paths differ from ordinary Dyck paths by using an up-step of length . We analyze at which level the path is after the -th up-step and before the st up-step. In honour of Rainer Kemp who studied a related concept 40 years ago the terms \textsc{max}-terms and \textsc{min}-terms are used. Results are obtained by an appropriate use of trivariate generating functions; practically no combinatorial arguments are used.
Keywords
Cite
@article{arxiv.2112.06557,
title = {MIN-turns and MAX-turns in k-Dyck paths: a pure generating function approach},
author = {Helmut Prodinger},
journal= {arXiv preprint arXiv:2112.06557},
year = {2023}
}