Words, Dyck paths, Trees, and Bijections
Combinatorics
2019-10-28 v1
Abstract
In \cite{BaDeFePi96} the concept of nondecreasing Dyck paths was introduced. We continue this research by looking at it from the point of view of words, rational languages, planted plane trees, and continued fractions. We construct a bijection with planted plane trees of height and compute various statistics on trees that are the equivalents of nondecreasing Dyck paths.
Cite
@article{arxiv.1910.11808,
title = {Words, Dyck paths, Trees, and Bijections},
author = {Helmut Prodinger},
journal= {arXiv preprint arXiv:1910.11808},
year = {2019}
}
Comments
This paper is hard to find and was "rediscovered" without giving me credits. Words, Dyck Paths, Trees, and Bijections (H Prodinger) Publisher: World scientific, Singapore, 2001