A bijection between two subfamilies of Motzkin paths
Combinatorics
2020-07-07 v1
Abstract
Two subfamilies of Motzkin paths, with the same numbers of up, down, horizontal steps were known to be equinumerous with ternary trees and related objects. We construct a bijection between these two families that does not use any auxiliary objects, like ternary trees.
Cite
@article{arxiv.2007.02142,
title = {A bijection between two subfamilies of Motzkin paths},
author = {Nancy S. S. Gu and Helmut Prodinger},
journal= {arXiv preprint arXiv:2007.02142},
year = {2020}
}