Grand Motzkin Paths and \(\{0,1,2\}\)-Trees -- A Simple Bijection
<div>A well-known bijection between Motzkin paths and ordered trees with outdegree always \(\le2\), is lifted to Grand Motzkin paths (the nonnegativity is dropped) and an ordered list of an odd number of such \(\{0,1,2\}\) trees. This offers an alternative to a recent paper by Rocha and Pereira Spreafico.</div>
Authors
- Helmut Prodinger (ORCID: https://orcid.org/0000-0002-0009-8015)
Publication Details
- Journal
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Published
- 2024-12-31
- DOI
- https://doi.org/10.61091/jcmcc123-37
- Primary Topic
- Advanced Combinatorial Mathematics
- Type
- article
- Field-Weighted Citation Impact
- 0.00