Grand Motzkin paths and \0,1,2\-trees -- a simple bijection

DOI10.61091/JCMCC123-37MaRDI QIDQ7023360zbMATH OpenFDO

Authors Helmut Prodinger

Publication date 21 February 2025

Published in JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.61091/JCMCC123-37

zbMATH Keywords

bijectionMotzkin pathsunary-binary trees

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38)

Cites work

• A bijection between ordered trees and 2-Motzkin paths and its many consequences
• A Combinatorial Bijection between Ordered Trees and Lattice Paths
• Analytic combinatorics
• Enumeration of edges in some lattices of paths
• scientific article; zbMATH DE number 3761421 (Why is no real title available?)
• scientific article; zbMATH DE number 3443655 (Why is no real title available?)
• scientific article; zbMATH DE number 3390782 (Why is no real title available?)
• Relations between hypersurface cross ratios, and a combinatorial formula for partitions of a polygon, for permanent preponderance, and for non-associative products

This page was built for publication: Grand Motzkin paths and \(\{0,1,2\}\)-trees -- a simple bijection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7023360)