Bijections are presented between certain classes of trees and multichains in non-crossing partition lattice'+.
Ordered trees and non-crossing partitions
โ Scribed by Nachum Dershowitz; Shmuel Zaks
- Publisher
- Elsevier Science
- Year
- 1986
- Tongue
- English
- Weight
- 229 KB
- Volume
- 62
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
โฆ Synopsis
of non-crossing partitions.
๐ SIMILAR VOLUMES
This paper studies the enumerations and some interesting combinatorial properties of heap-ordered trees (HOTs). We first derive analytically the total numbers of \(n\)-node HOTs. We then show that there exists a 1-1 and onto correspondence between any two of the following four sets: the set of \((n+
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
The partitions of a natural number n (with parts taken in non-increasing order), may be listed in dictionary order. This ordering of partitions is shown to correspond to the post ordering of chains of a finite tree T[n]. It is shown that T[n] belongs to a, the class of normal trees. % occurs indepen
We introduce an extension of the notion of R-transform, defined by D. Voiculescu, to ( free) joint distributions, i.e., normalized linear functionals on algebras of noncommutative polynomials in several indeterminates. We point out that the R-transform has good behavior with respect to the operation
We present observations and problems connected with a weighted binary tree representation of integer partitions. ๏ฃฉ 2002 Elsevier Science (USA)