A bijection between ordered trees and bicoloured ordered trees
暂无分享,去创建一个
A bijection is introduced between ordered trees and bicoloured ordered trees, which maps leaves in an ordered tree to odd height vertices in the related tree. Consequently, a bijection between two sets of bridges specified with four parameters is derived.
[1] Paul Moszkowski,et al. A New Bijection Between Ordered Trees and Legal Bracketings , 1996, Eur. J. Comb..
[2] Nachum Dershowitz,et al. Ordered trees and non-crossing partitions , 1986, Discret. Math..
[3] Germain Kreweras. Joint distributions of three descriptive parameters of bridges , 1986 .
[4] Helmut Prodinger. A correspondence between ordered trees and noncrossing partitions , 1983, Discret. Math..
[5] Doron Zeilberger. Six etudes in generating functions , 1989 .