A central limit theorem for integer partitions into small powers

DOI10.1007/S00605-023-01926-YMaRDI QIDQ6137884zbMATH OpenOpenAlexFDO

Authors Gabriel F. Lipnik, Manfred G. Madritsch, Robert F. Tichy

Publication date 16 January 2024

Published in Monatshefte für Mathematik (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2204.05592

zbMATH Keywords

central limit theoreminteger partitionsMellin transformpartition functionsaddle-point method

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Analytic theory of partitions (11P82) Central limit and other weak theorems (60F05)

Abstract: The study of the well-known partition function $p(n)$ counting the number of solutions to $n=a_1+dots+a_{ell}$ with integers $1leq{a}_{1}leqdotsleq{a}_{ell}$ has a long history in combinatorics. In this paper, we study a variant, namely partitions of integers into �egin{equation*} n=lfloor a_1^alpha floor + cdots + lfloor a_ell^alpha floor end{equation*} with $1leq{a}_1<cdots<a_{e}ll$ and some fixed $0<alpha<1$. In particular, we prove a central limit theorem for the number of summands in such partitions, using the saddle point method.

Review text

The authors consider restricted partitions of a positive integer \(n\) into ``small powers, i.e., numbers of the form \(\lfloor k^{\alpha} \rfloor\), where \(\alpha\) is a fixed real number in \((0,1)\). Such a restricted partition is a representation of the form \[n = \lfloor a_1^{\alpha} \rfloor + \lfloor a_2^{\alpha} \rfloor + \cdots + \lfloor a_{\ell}^{\alpha} \rfloor,\] where the \(a_i\) are integers with \(1 \leq a_1 < a_2 < \cdots < a_{\ell}\). The paper specifically studies the distribution of the number of summands: asymptotic formulas for mean and variance of this number in a uniformly random restricted partition are shown along with a central limit theorem as \(n \to \infty\). The proofs are largely based on the saddle point method and the Mellin transform.

Recommendations

• Limit theorems for the number of summands in integer partitions
• A central limit theorem for integer partitions
• On the number of summands in a random prime partition
• Distribution of integer partitions with large number of summands
• Power partitions and saddle-point method

Cites work

• A central limit theorem for integer partitions
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• A Meinardus theorem with multiple singularities
• A Note on the Theory of Moment Generating Functions
• A Tauberian theorem for partitions
• An explicit bound for the number of partitions into roots
• Analytic combinatorics
• Asymptotische Aussagen über Partitionen
• Mellin transforms and asymptotics: Digital sums
• Mellin transforms and asymptotics: Harmonic sums
• Note on square-root partitions into distinct parts
• On the \(k\)th root partition function
• On the \(r\)-th root partition function
• On the \(r\)-th root partition function. II.
• On the number of factorizations of an integer
• On the number of summands in a random prime partition
• On the Partition Function p (n )
• On the square-root partition function
• Part sizes of random integer partitions
• Power partitions and saddle-point method
• The distribution of the number of summands in the partitions of a positive integer
• The number of distinct part sizes in a random integer partition
• The saddle-point method for general partition functions
• Three problems in combinatorial asymptotics

Cited in

(3)

• Boltzmann distribution on ``short integer partitions with power parts: limit laws and sampling
• Trees with flowers: a catalog of integer partition and integer composition trees with their asymptotic analysis
• A local limit theorem for integer partitions into small powers

This page was built for publication: A central limit theorem for integer partitions into small powers

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