A new bijection between ordered trees and legal bracketings (Q1815397): Difference between revisions

The Catalan numbers are known to enumerate the legal bracketings of length \(n\), as well as the ordered trees with \(n+1\) vertices. This paper examines a new bijection between these objects, which has interesting combinatorial properties. This new bijection is shown to provide a connection between the classical (legal bracketing/ordered trees) bijection and another recently discovered bijection.