Enumeration of Deutsch paths by adding the adding-a-new-slice method and applications
Combinatorics
2021-04-22 v3
Abstract
A variation of Dyck paths allows for down-steps of arbitrary length, not just one. This is motivated by ideas due to Emeric Deutsch. We use the adding-a-new-slice technique and the kernel method to compute the number of maximal runs of up-step runs of length 1 and a subclass of Deutsch paths satisfying a condition that was stipulated by R. Stanley for Dyck paths.
Keywords
Cite
@article{arxiv.2006.00565,
title = {Enumeration of Deutsch paths by adding the adding-a-new-slice method and applications},
author = {Helmut Prodinger},
journal= {arXiv preprint arXiv:2006.00565},
year = {2021}
}
Comments
Title has been changed. A new section has been added