A bijection between ordered trees and bicoloured ordered trees
โ Scribed by Chunlin Liu; Zhenghua Wang
- Book ID
- 108114017
- Publisher
- Elsevier Science
- Year
- 2009
- Tongue
- English
- Weight
- 400 KB
- Volume
- 309
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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 parameters "number of nodes of degree q" and "number of odd-level nodes of degree q-1" are equidistributed.
A bijection is given between the set of directed column-convex polyominoes of area n and the set of ordered trees of height at most three and having n edges. Additional bijections with less well known combinatorial objects are sketched.
The Narayana numbers n appear twice in Volume 31 of Discrete Mathematics: They count the ordere0 trees with n edges (i.e. n+l nodes) and k leaves [1] and the noncrossing partitions of {1 ..... n} into k blocks . (In such a partition the existence of four numbers a<b<c<d such that a and c are in one
In accordance with the principle from other branches of mathematics that it is better to exhibit an explicit isomorphism between two objects than merely to prove that they are isomorphic, we adopt the general principle that it is better to exhibit one-to-one correspondence (bijection) between two se