Nuclear partitions and a formula for p(n)

MaRDI QIDQ5003754zbMATH OpenFDO

Authors

Publication date 29 July 2021

Full work available at URL https://arxiv.org/abs/1912.00575, http://www.mathjournals.org/jrms/2021-036-001/2021-036-001-004.html

zbMATH Keywords

partitioncongruencefirst differencesecond differencenuclear partition

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Elementary theory of partitions (11P81) Partitions; congruences and congruential restrictions (11P83)

Abstract: Define a "nuclear partition" to be an integer partition with no part equal to one. In this study we prove a simple formula to compute the partition function $p(n)$ by counting only the nuclear partitions of $n$, a vanishingly small subset by comparison with all partitions of $n$ as $noinfty$. Variations on the proof yield other formulas for $p(n)$, as well as Ramanujan-like congruences and an application to parity of the partition function.

Recommendations

• A formula for the partition function that ``counts
• An explicit formula for computing the partition numbers \(p(n)\)
• Computations of the partition function
• Partitions and the grand canonical ensemble
• Computing the integer partition function

Cites work

• scientific article; zbMATH DE number 3577263 (Why is no real title available?)
• A formula for the partition function that ``counts
• An arithmetic formula for the partition function
• Differences of the partition function
• Higher-order differences and higher-order partial sums of Euler's partition function

Cited in

(6)

• Fractal form of the partition functions \(p(n)\)
• THE SECOND SHIFTED DIFFERENCE OF PARTITIONS AND ITS APPLICATIONS
• The multiplicity formula \(\nu^n_r\)
• Fermi's Theory of the Generation of Pions and the Partition Theory of Numbers
• Computational study of non-unitary partitions
• The Bohr-Kalckar correspondence principle and a new construction of partitions in number theory

This page was built for publication: Nuclear partitions and a formula for \(p(n)\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5003754)