𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Composite Fermions and Integer Partitions

✍ Scribed by Arthur T. Benjamin; Jennifer J. Quinn; John J. Quinn; Arkadiusz Wójs

Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
111 KB
Volume
95
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

✦ Synopsis

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 angular momentum multiplets of a system of N fermions, each with angular momentum l, to those of a system in which each Fermion has angular momentum l*=l&N+1.

📜 SIMILAR VOLUMES

Integer Partitions and Binary Trees
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)

Spin-Singlet Pairing of Composite Fermio
Spin-Singlet Pairing of Composite Fermions
✍ B. Kramer; E. Mariani; N. Magnoli; M. Merlo; F. Napoli; M. Sassetti 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 125 KB
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