𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Heap-ordered Trees, 2-Partitions and Continued Fractions

✍ Scribed by Wen-Chin Chen; Wen-Chun Ni


Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
139 KB
Volume
15
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

✦ Synopsis


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+1))-node HOTs, the set of 2-partitions of (\mathbf{Z}{2 n}=) ({1,2, \ldots, 2 n}), the set of Young tableaux from (\mathbf{Z}{2 n}) without odd-length columns, and the set of weighted paths of length (2 n). These correspondences can not only be used to obtain the above enumeration quantities through combinatorial arguments, but can also relate their generating functions to continued fractions.


πŸ“œ SIMILAR VOLUMES


Fractional Order Continuity and Some Pro
✍ B. Bonilla; J.J. Trujillo; M. Rivero πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 72 KB

In this paper a certain function space C Ξ± , 0 ≀ Ξ± ≀ 1, larger than the space of continuous functions, is introduced in order to study new properties and the extension of some already known results about the Riemann-Liouville fractional integral and derivative operators. Sufficient conditions for t

The Continued Fraction Algorithm and Reg
✍ Robert J. Zuccherato πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 316 KB

The continued fraction expansion and infrastructure for quadratic congruence function fields of odd characteristic have been well studied. Recently, these ideas have even been used to produce cryptosystems. Much less is known concerning the continued fraction expansion and infrastructure for quadrat