A bijection on ordered trees and its consequences

DOI10.1006/jcta.1999.3027zbMath0943.05031OpenAlexW2030390773MaRDI QIDQ1976326

Emeric Deutsch

Publication date: 28 August 2000

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcta.1999.3027

zbMATH Keywords

bijectionMotzkin numbersordered treeslevel of a node

Mathematics Subject Classification ID

Trees (05C05)

Related Items (7)

Parity reversing involutions on plane trees and 2-Motzkin paths ⋮ Unnamed Item ⋮ A refinement of leaves on noncrossing trees ⋮ Counting strings in Dyck paths ⋮ Enumeration of strings in Dyck paths: A bijective approach ⋮ Odd or even on plane trees ⋮ Two bijections on weakly increasing trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enumerations of ordered trees
• A symmetric variation of a distribution of Kreweras and Poupard
• Enumeration of plane trees by branches and endpoints
• Restricted plane tree representations of four Motzkin-Catalan equations
• Constraint-sensitive Catalan path statistics having the Narayana distribution
• Catalan path statistics having the Narayana distribution
• Trees associated with the Motzkin numbers
• A transformation on ordered trees
• Six etudes in generating functions
• Correspondences between plane trees and binary sequences
• Relations between hypersurface cross ratios, and a combinatorial formula for partitions of a polygon, for permanent preponderance, and for non-associative products
• Motzkin numbers

This page was built for publication: A bijection on ordered trees and its consequences