General moment theorems for non-distinct unrestricted partitions
Michael Coons, Klaus Kirsten

TL;DR
This paper develops general theorems for the moments of non-distinct unrestricted partitions of integers, using zeta-functions and saddle-point methods, with applications to sequences relevant in statistical mechanics.
Contribution
It introduces new moment theorems for partitions based on arbitrary sequences, extending classical results and applying advanced analytical techniques.
Findings
Derived asymptotic formulas for higher moments of partition sequences
Calculated expected number of summands in partitions
Applied results to sequences of Barnes and Epstein types
Abstract
A well-known result from Hardy and Ramanujan gives an asymptotic expression for the number of possible ways to express an integer as the sum of smaller integers. In this vein, we consider the general partitioning problem of writing an integer as a sum of summands from a given sequence of non-decreasing integers. Under suitable assumptions on the sequence , we obtain results using associated zeta-functions and saddle-point techniques. We also calculate higher moments of the sequence as well as the expected number of summands. Applications are made to various sequences, including those of Barnes and Epstein types. These results are of potential interest in statistical mechanics in the context of Bose-Einstein condensation.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
