A new bijection on rooted forests (Q686461)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 428312
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new bijection on rooted forests |
scientific article; zbMATH DE number 428312 |
Statements
A new bijection on rooted forests (English)
0 references
20 December 1993
0 references
A semilabelled tree is a rooted tree with labelled leaves. Earlier, the author and \textit{L. A. Székely} [Adv. Appl. Math. 10, No. 4, 488-496 (1989; Zbl 0723.05046)] gave a bijection, involving antilexicographic order, between semilabelled trees and certain partitions. The author of the present paper extends this earlier work by giving a bijection between semilabelled forests and certain multisets. Various formulas for the number of semilabelled and labelled forests with certain properties follow readily as consequences of the bijection.
0 references
enumeration
0 references
semilabelled tree
0 references
bijection
0 references
partitions
0 references
forests
0 references
0.8045558929443359
0 references
0.7826291918754578
0 references
0.7697350978851318
0 references
0.7618765234947205
0 references
