Grand Motzkin Paths and {0, 1, 2}-Trees-A Simple Bijection

被引：0

作者：

Prodinger, Helmut ^{[1
,2
]}

机构：

[1] Department of Mathematics, University of Stellenbosch, Stellenbosch

来源：

Journal of Combinatorial Mathematics and Combinatorial Computing | 2024年 / 123卷

关键词：

Bijection; Motzkin paths; Unary-binary trees;

D O I：

10.61091/jcmcc123-37

中图分类号：

学科分类号：

摘要：

A well-known bijection between Motzkin paths and ordered trees with outdegree always ≤ 2, 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. © 2024 The Author(s).

引用

页码：521 / 525

页数：4