A bijection on ordered trees and its consequences
A bijection is introduced in the set of all ordered trees having \(n\) edges from which one derives that, for each positive integer \(q\), the number of nodes of degree \(q\) and the number of odd-level nodes of degree \(q-1\) are equidistributed. Since ordered trees with no nodes of degree higher than 2 are enumerated by the Motzkin numbers, it follows that also the ordered trees with no branching nodes at odd levels are enumerated by the Motzkin numbers. This is a recent result of \textit{A. Kuznetsov, I. Pak} and \textit{A. Postnikov} [J. Comb. Theory, Ser. A 76, No. 1, 145-147 (1996; Zbl 0860.05003)], which has inspired the author of this note.
- A bijection between ordered trees and 2-Motzkin paths and its many consequences
- A bijection between ordered trees and bicoloured ordered trees
- About half the middle binomial coefficient
- Trees associated with the Motzkin numbers
- A bijection between symmetric valleys in Dyck paths and even degree interval vertices in ordered trees
- A symmetric variation of a distribution of Kreweras and Poupard
- A transformation on ordered trees
- Catalan path statistics having the Narayana distribution
- Constraint-sensitive Catalan path statistics having the Narayana distribution
- Correspondences between plane trees and binary sequences
- Enumeration of plane trees by branches and endpoints
- Enumerations of ordered trees
- scientific article; zbMATH DE number 3989356 (Why is no real title available?)
- scientific article; zbMATH DE number 3723873 (Why is no real title available?)
- scientific article; zbMATH DE number 718142 (Why is no real title available?)
- scientific article; zbMATH DE number 729555 (Why is no real title available?)
- scientific article; zbMATH DE number 815575 (Why is no real title available?)
- Motzkin numbers
- Relations between hypersurface cross ratios, and a combinatorial formula for partitions of a polygon, for permanent preponderance, and for non-associative products
- Restricted plane tree representations of four Motzkin-Catalan equations
- Six etudes in generating functions
- Trees associated with the Motzkin numbers
- Enumeration of strings in Dyck paths: A bijective approach
- Bijections for Cayley trees, spanning trees, and their q-analogues
- On trees and tree dimension of ordered sets
- Odd or even on plane trees
- A bijection between ordered trees and 2-Motzkin paths and its many consequences
- A refinement of leaves on noncrossing trees
- Two bijections on weakly increasing trees
- A combinatorial bijection on di-sk trees
- Tree/endofunction bijections and concentration inequalities
- Counting strings in Dyck paths
- About half the middle binomial coefficient
- scientific article; zbMATH DE number 6928780 (Why is no real title available?)
- scientific article; zbMATH DE number 1827835 (Why is no real title available?)
- A bijection between symmetric valleys in Dyck paths and even degree interval vertices in ordered trees
- scientific article; zbMATH DE number 7152756 (Why is no real title available?)
- Systems of iterated projective ordinal notations and combinatorial statements about binary labeled trees
- Skew diagrams and ordered trees
- More bijective combinatorics of weakly increasing trees
- Scaling limits of random looptrees and bipartite plane maps with prescribed large faces
- Random monotone factorisations of the cycle and their lamination process
- Bijections in weakly increasing trees via binary trees
- A symmetry on weakly increasing trees and multiset Schett polynomials
- Parity reversing involutions on plane trees and 2-Motzkin paths
- A bijection from ordered trees to binary trees that sends the pruning order to the Strahler number
- Bijections for a class of labeled plane trees
This page was built for publication: A bijection on ordered trees and its consequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1976326)
