On the enumeration of Hoppy's walks
Combinatorics
2020-10-20 v3
Abstract
The enumeration of k-Dyck paths ending at level j after m up-steps, where the last step is an up-step, is given as a sum, improving on a previous formula given by Deng and Mansour.
Keywords
Cite
@article{arxiv.2009.13474,
title = {On the enumeration of Hoppy's walks},
author = {Helmut Prodinger},
journal= {arXiv preprint arXiv:2009.13474},
year = {2020}
}
Comments
A new section has been added with early adventures of Hoppy