Grand Motzkin paths and \0,1,2\-trees -- a simple bijection
Abstract
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.