๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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


Multichains, non-crossing partitions and
โœ Paul H. Edelman ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 608 KB

Bijections are presented between certain classes of trees and multichains in non-crossing partition lattice'+.

Heap-ordered Trees, 2-Partitions and Con
โœ Wen-Chin Chen; Wen-Chun Ni ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 139 KB

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+

A correspondence between ordered trees a
โœ Helmut Prodinger ๐Ÿ“‚ Article ๐Ÿ“… 1983 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 54 KB

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

Partitions and normal trees
โœ Muhammad Ali McBeth; Rod McBeth ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 373 KB

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

R-Transforms of Free Joint Distributions
โœ Alexandru Nica ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 909 KB

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

Integer Partitions and Binary Trees
โœ Frank Schmidt ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 82 KB

We present observations and problems connected with a weighted binary tree representation of integer partitions. ๏ฃฉ 2002 Elsevier Science (USA)