✦ LIBER ✦

Multichains, non-crossing partitions and trees

✍ Scribed by Paul H. Edelman

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 608 KB
Volume: 40
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(82)90118-2

No coin nor oath required. For personal study only.

✦ Synopsis

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

📜 SIMILAR VOLUMES

Ordered trees and non-crossing partition

Ordered trees and non-crossing partitions

✍ Nachum Dershowitz; Shmuel Zaks 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 229 KB

of non-crossing partitions.

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

R-Transforms of Free Joint Distributions and Non-crossing Partitions

✍ 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)

On trees and noncrossing partitions

✍ Martin Klazar 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 426 KB

We give a simple and natural proof of (an extension of) the identity P(X. 1. )I ) = t-'2( X I. I -I. II --I ). The number P(li, I, 17) counts noncrossing partitions of { I, 2. I} unto II parts such that no part contains two numbers .Y and J'. O<.v --.v<k. The lower index 2 indicate\ partitions with

The Lattice of Non-crossing Partitions a

The Lattice of Non-crossing Partitions and the Birkhoff-Lewis Equations

✍ D.M. Jackson 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 186 KB

A matrix associated with the chromatic join of non-crossing partitions has been introduced by Tutte to generalise the Birkhoff-Lewis equations. A conjecturc is given for its determinant in terms of polynomials having the Beraha numbers among their roots. Corrcsponding results for join and meet on th