Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Grand Motzkin Paths and \(\{0,1,2\}\)-Trees — A Simple Bijection

Helmut Prodinger1,2
1Department of Mathematics, University of Stellenbosch 7602, Stellenbosch, South Africa
2NITheCS (National Institute for Theoretical and Computational Sciences), South Africa
  • Received: 29/09/2024
  • Accepted: 05/12/2024
  • Published: 31/12/2024

Abstract

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.
Keywords: Motzkin paths, Unary-binary trees, Bijection
Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
Helmut Prodinger. Grand Motzkin Paths and \(\{0,1,2\}\)-Trees — A Simple Bijection[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 123. -. DOI: https://doi.org/10.61091/jcmcc123-37.