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

Ordered partitions and drawings of rooted plane trees

โœ Scribed by Ren, Qingchun

Book ID
127232954
Publisher
Elsevier Science
Year
2015
Tongue
English
Weight
439 KB
Volume
338
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ 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.

Some properties of plane rooted trees
Some properties of plane rooted trees
โœ I. V. Konoval'tsev; E. P. Lipatov ๐Ÿ“‚ Article ๐Ÿ“… 1973 ๐Ÿ› Springer US ๐ŸŒ English โš– 340 KB
Strictly-upward drawings of ordered sear
Strictly-upward drawings of ordered search trees
โœ P. Crescenzi; P. Penna ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 927 KB

We prove that any logarithmic binary tree admits a linear-area straight-line strictly-upward planar grid drawing (in short, strictly-upward drawing), that is, a drawing in which (a) each edge is mapped into a single straight-line segment, (b) each node is placed below its parent, (c) no two edges in

A correspondence between ordered trees a
A correspondence between ordered trees and noncrossing partitions
โœ 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

Heap-ordered Trees, 2-Partitions and Con
Heap-ordered Trees, 2-Partitions and Continued Fractions
โœ 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+