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

Integer Partitions and Binary Trees

โœ Scribed by Frank Schmidt

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
82 KB
Volume
28
Category
Article
ISSN
0196-8858

No coin nor oath required. For personal study only.

โœฆ Synopsis

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

๐Ÿ“œ SIMILAR VOLUMES

Composite Fermions and Integer Partition
Composite Fermions and Integer Partitions
โœ Arthur T. Benjamin; Jennifer J. Quinn; John J. Quinn; Arkadiusz Wรณjs ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 111 KB

We utilize the KOH theorem to prove the unimodality of integer partitions with at most a parts, all parts less than or equal to b, that are required to contain either repeated or consecutive parts. We connect this result to an open question in quantum physics relating the number of distinct total an

Parallel Algorithms for Counting and Ran
Parallel Algorithms for Counting and Randomly Generating Integer Partitions
โœ Laura A. Sanchis; Matthew B. Squire ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 228 KB

This paper presents parallel algorithms for determining the number of partitions of a given integer N, where the partitions may be subject to restrictions, such as being composed of distinct parts, of a given number of parts, and/or of parts belonging to a specified set. We present a series of adapt

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+