A simple bijection between binary trees and colored ternary trees

zbMATH Open1189.05051arXiv0805.1279MaRDI QIDQ976673FDOQ976673

Authors: Yidong Sun 

Publication date: 16 June 2010

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/0805.1279

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

binary treegeneralized Catalan numberternary tree

Mathematics Subject Classification ID

Trees (05C05) Combinatorial identities, bijective combinatorics (05A19)

Cited In (6)

• Non-overlapping descents and ascents in stack-sortable permutations
• Title not available (Why is that?)
• Generalizations of two identities of Guo and Yang
• A bijection from ordered trees to binary trees that sends the pruning order to the Strahler number
• Some notes on the \((q, t)\)-Stirling numbers
• Lagrange inversion

This page was built for publication: A simple bijection between binary trees and colored ternary trees

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