A simple bijection between binary trees and colored ternary trees
classification
🧮 math.CO
keywords
treesbijectionbinarycoloredsimpleternarycatalanderive
read the original abstract
In this short note, we first present a simple bijection between binary trees and colored ternary trees and then derive a new identity related to generalized Catalan numbers.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.