The height of skew Dyck paths with two variants of downsteps
Discrete Mathematics & Theoretical Computer Science · 23.07.2026 · vol. 28:3 (Combinatorics)
DOI: 10.46298/dmtcs.17510 ↗Kurz gefasst
Fachartikel in der Zeitschrift Discrete Mathematics & Theoretical Computer Science, online erschienen am 23.07.2026. Verfasst von Helmut Prodinger.
Abstract (Originalsprache)
Recently, in the context of walks of hexagonal circle packings, interest has emerged in the family of skew Dyck paths with two variants of down-steps. These paths have steps $U, D_g, D_b, L=D_r$. Using generating functions, the kernel method and (in)finite linear systems, contributions to the (average) height and other enumerations are made. As in many similar instances, the average height is of order $\sqrt n$. Suggestions by two reviewers are included. Third version contains some formatting
Zitieren
APA
Prodinger, H. (2026). The height of skew Dyck paths with two variants of downsteps. Discrete Mathematics & Theoretical Computer Science, vol. 28:3(Combinatorics). https://doi.org/10.46298/dmtcs.17510
Vancouver
Prodinger H. The height of skew Dyck paths with two variants of downsteps. Discrete Mathematics & Theoretical Computer Science. 2026;vol. 28:3(Combinatorics). doi:10.46298/dmtcs.17510
BibTeX
@article{Prodinger2026,
author = {Prodinger, Helmut},
title = {The height of skew Dyck paths with two variants of downsteps},
journal = {Discrete Mathematics & Theoretical Computer Science},
year = {2026},
volume = {vol. 28:3},
number = {Combinatorics},
doi = {10.46298/dmtcs.17510}
}
EUVIMED