✦ LIBER ✦

Partitions and normal trees

✍ Scribed by Muhammad Ali McBeth; Rod McBeth

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 373 KB
Volume: 79
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(90)90058-p

No coin nor oath required. For personal study only.

✦ Synopsis

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 independently in Logic and in Combinatorics.

📜 SIMILAR VOLUMES

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

Multichains, non-crossing partitions and

Multichains, non-crossing partitions and trees

✍ 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'+.

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.

k-Path partitions in trees

✍ Jing-Ho Yan; Gerard J. Chang; Sandra M. Hedetniemi; stephen T. Hedetniemi 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 437 KB

For a fixed positive integer k, the k-path partition problem is to partition the vertex set of a graph into the smallest number of paths such that each path has at most k vertices. The 2path partition problem is equivalent to the edge-cover problem. This paper presents a linear-time algorithm for th

On partitions of graphs into trees

✍ F.R.K. Chung 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 934 KB

We crgnsider the minimum m\*-nber T(G) of subsets intl:, which the edge set E(G) of a graph G can lx partitioned so that each subset forms a tree. It is shown that for any connected (3 with II vertices, we always have T( Gj s [$I.