A new bijection between ordered trees and legal bracketings

DOI10.1006/EUJC.1996.0051zbMATH Open0863.05005OpenAlexW2095436393MaRDI QIDQ1815397FDOQ1815397

Paul Moszkowski, S. Benchekroun

Publication date: 16 December 1996

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/eujc.1996.0051

Recommendations

• A subclass of labeled ternary trees and its generalization
• A bijection between ordered trees and 2-Motzkin paths and its many consequences
• A bijective proof of an enumerative property of legal bracketings
• Tree-like properties of cycle factorizations
• scientific article; zbMATH DE number 2221988

zbMATH Keywords

bijectionCatalan numbersordered treeslegal bracketings

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15)

Cited In (14)

• Greedy Gray codes for Dyck words and ballot sequences
• Topological enumeration of complex polynomial vector fields
• Operated semigroups, Motzkin paths and rooted trees
• An area-depth symmetric \(q, t\)-Catalan polynomial
• Ordered trees and the inorder traversal
• An involution on Dyck paths and its consequences
• Dyck path enumeration
• Title not available (Why is that?)
• A bijective proof of an enumerative property of legal bracketings
• Constraint-sensitive Catalan path statistics having the Narayana distribution
• Catalan path statistics having the Narayana distribution
• The Narayana distribution
• A bijection between ordered trees and bicoloured ordered trees
• Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths

This page was built for publication: A new bijection between ordered trees and legal bracketings

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