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 \(1 \le a_{1} \le \dots \le a_{\ell }\) has a long history in number theory and combinatorics. In this paper, we study a variant, namely partitions of integers into
with \(1\le a_1< \cdots < a_\ell \) 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.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
For a positive integer n, let f(n) denote the number of unordered factorizations as products of integer factors greater than 1. Balasubramanian and Luca [1] considered the set
In order to provide an upper bound for \({\left|\mathcal {F}(x) \right|}\), they had to analyse the number q(n) of partitions of n of the form
with integers \(1\le a_1\le \cdots \le a_\ell \), where \(\left\lfloor x\right\rfloor \) denotes the integer part of x.
Chen and Li [2] proved a similar result, and Luca and Ralaivaosaona [19] refined the previous results to obtain the asymptotic formula
where
and A is the Glaisher–Kinkelin constant. Li and Chen [16, 17] extended the result to arbitrary powers \(0<\alpha <1\) not being of the form \(\alpha =1/m\) for a positive integer m. Finally, Li and Wu [18] considered the case of \(\alpha =1/m\). They obtained a complete expansion along lines similar to the one in Tenenbaum, Wu and Li [25] as well as in Debruyne and Tenenbaum [6].
In the present paper, we take a different point of view. For fixed \(0<\alpha <1\), we consider the distribution of the length of restricted \(\alpha \)-partitions. A restricted \(\alpha \)-partition of n is a representation of n of the form
with integers \(1\le a_1< a_2< \cdots < a_\ell \), and \(\ell \) is called its length. We denote by \(q(n,\ell )\) the number of restricted partitions of length \(\ell \).
In the literature also unrestricted partitions are considered. We call a partition unrestricted if the \(a_i\)’s can be equal, i.e. \(1\le a_1\le a_2\le \cdots \le a_\ell \). Analogously we denote by p(n) and \(p(n,\ell )\) the number of unrestricted partitions as well as the number of unrestricted partitions of length \(\ell \).
The asymptotic analysis of partition problems has its origin in the work of Hardy and Ramanujan, see for instance [13]. Their proof is based on properties of elliptic modular functions and later Rademacher [22] and followers could achieve full asymptotic expansions by this method. Ingham [15] developed a more elementary approach (comparable to our method) for the asymptotic analysis of certain partition problems. Here we also want to mention the work Chern [3], who obtained the asymptotics with explicit constants for the partition function in the case \(\alpha =\tfrac{1}{2}\).
Erdős and Lehner [7] were among the first to consider the distribution of the length of a partition. In particular they considered the ratio \(p(n,\ell )/p(n)\), where \(\ell =(2\pi ^2/3)^{-\frac{1}{2}}\sqrt{n}\log n+x\sqrt{n}\) is a function of n. The study of distinct parts was introduced by Wilf [26]. Goh and Schmutz [11] proved a central limit theorem for the distribution of part sizes. Their result was extended by Schmutz [24] to multivariate cases under the Meinardus’ scheme (cf. Meinardus [21]). Hwang [14] provided an extended version with weaker necessary conditions to obtain limit theorems for the number of summands in a random partition (restricted and unrestricted).
While Meinardus’ original scheme can handle Dirichlet generating functions with a single pole on the positive real axis, Granovsky and Stark [12] and Chern [3] adapted the method for multiple poles on the real axis. Madritsch and Wagner [20] considered sets with digital restrictions, leading to a Dirichlet generating function having equidistant poles along a vertical line in the complex plane, and proved a central limit theorem. Motivated by a question in Hwang’s paper [14] Ralaivaosaona [23] established a central limit theorem for partitions in primes. In the present paper, we use a similar method for the case of multiple poles on the real line.
2 Main Result
Let \(0<\alpha <1\) be a fixed real number. We let \(\Pi (n)\) denote the set of partitions of a positive integer n into parts \(\left\lfloor a_j^{\alpha }\right\rfloor \) where each \(a_j\) occurs at most once. These partitions are called (restricted) \(\alpha \)-partitions for short. Furthermore, let \(q(n)={\left|\Pi (n) \right|}\) be the cardinality of the set \(\Pi (n)\). Finally, we let \(\Pi (n,k)\) denote the subset of partitions \(\Pi (n)\) whose length (number of summands) is k and \(q(n,k)={\left|\Pi (n,k) \right|}\) is its cardinality.
In the present work, we consider the random variable \(\varpi _n\) counting the number of summands in a random \(\alpha \)-partition of n. The probability distribution of \(\varpi _n\) is given by \({\mathbb {P}}(\varpi _n = k)= q(n,k)/q(n)\). In order to obtain a central limit theorem for \(\varpi _n\), we have to carefully analyse the associated bivariate generating function Q(z, u), which is given by
Furthermore, for a fixed integer \(k \ge 1\), we let g(k) denote the number of integers \(n \ge 1\) satisfying \(\left\lfloor n^\alpha \right\rfloor =k\), i.e.,
with \(\beta :=1/\alpha \). Then the following lemma holds.
Lemma 1
With the notation above, we have
Proof
By the definition of g(k), we have \(\left\lfloor a_{j}^\alpha \right\rfloor =k\) for exactly g(k) different integers \(a_{j}\). Thus, it follows that
Furthermore, it holds that
\(\square \)
Now we can state the main theorem of this work as follows.
Theorem 2
Let \(0<\alpha <1\) and let \(\varpi _n\) be the random variable counting the number of summands in a random restricted partition of n into \(\alpha \)-powers. Then \(\varpi _n\) is asymptotically normally distributed with mean \({\mathbb {E}}(\varpi _n)\sim \mu _n\) and variance \({\mathbb {V}}(\varpi _n)\sim \sigma _n^2\), i.e.,
uniformly for all x as \(n\rightarrow \infty \). The mean \(\mu _n\) and the variance \(\sigma _n^2\) are given by
and
where \(\eta \) is the implicit solution of
Explicit formulæ for the occurring constants \(c_{1}\) and \(c_{2}\) are given in (4.12) and (4.13), respectively.
Finally, the tails of the distribution satisfy the exponential bounds
and the analogous inequalities also hold for \({\mathbb {P}}\bigl (\frac{\varpi _n - \mu _n}{\sigma _n}\le -x\bigr )\).
This result fits into the series of other results on partitions in integers of the form \(\lfloor k^\alpha \rfloor \) with \(k\ge 1\). In particular, if \(\alpha =1\), then we have the classic case of partitions and Erdős and Lehner [7] showed that \(\mu _n\sim cn^{1/2}\). For \(\alpha >1\), not every integer has a representation of the form \(\lfloor k^\alpha \rfloor \) and there are gaps in the set \(\{\left\lfloor k^{\alpha }\right\rfloor |{k\in {\mathbb {N}}}\}\). This led Hwang [14] to the result \(\mu _n\sim cn^{1/(\alpha +1)}\). Consequently, our result \(\mu _n\sim c_1n^{1/(\alpha +1)}\) seems to be a natural extension of these results.
One of the main difficulties of the case \(0<\alpha <1\) lies in the special structure of the function g(k). In particular, if \(\alpha =1/m\) with \(m\ge 2\) being an integer, then the parts of the partitions are mth roots and g(k) is given by the polynomial
However, in the general case of \(\alpha \not \in {\mathbb {Q}}\), we have an additional error term (see (3.8)) of which no explicit form is known. This makes the analysis more involved.
Finally, we want to mention that a local version of this central limit theorem is the topic of a subsequent project. In particular, it seems that the above mentioned error term of the function g(k) needs further considerations in this case.
3 Main Idea, Outline and Tools for the Proof
The proof of our main theorem consists of analytic and probabilistic parts. In the analytic part, we use Mellin transforms and the saddle-point method. The probabilistic part is based on the use of Curtiss’ theorem for moment-generating functions. Before we give the details of the proof, this section is dedicated to give an overview of the main techniques and tools.
We first note that the central limit theorem for the random variable \(\varpi _n\) is equivalent to the fact that the normalized moment-generating function \(M_n(t)={\mathbb {E}}(e^{(\varpi _n-\mu _n)t/\sigma _n})\) tends to \(e^{t^2/2}\) for \(t\rightarrow \infty \). Consequently, we will show this limit. Furthermore, the mentioned tail estimates can be obtained by the Chernoff bound.
Since \(\mu _n/\sigma _n\) is constant, we have \({\mathbb {E}}(e^{(\varpi _n-\mu _n)t/\sigma _n})=e^{-\mu _n/\sigma _n}{\mathbb {E}}(e^{\varpi _n t/\sigma _n})\). We recall that by Lemma 1, the probability-generating function \({\mathbb {E}}(u^{\varpi _n})\) is given by
In other words, it is sufficient for our purpose to obtain the coefficient of \(z^n\) in Q(z, u). By Cauchy’s integral formula, we derive
A standard transformation yields for \(r > 0\) that
with
For the integral in (3.1), we use the well-known saddle-point method, also known as the method of steepest decent. The main application of this method is to obtain estimates for integrals of the form
for some suitable function g. We choose \(t_n>0\) in order to split up the integral into two parts, one near the positive real axis and the other one for the rest, i.e.,
For the second integral, we compare the contribution of the integrand with the contribution from the real line, i.e., we estimate \(e^{g(r+it)-\Re (g(r))}\). This will contribute to the error term.
For the first integral in (3.2), we use a third order Taylor expansion of \(g(r+it)\) around \(t=0\), which is
Now we choose r such that the first derivative \(g'(r)\) vanishes. Then the remaining integral is given by
Now the integrand is that of a Gaussian integral and so we add the missing part. The Gaussian integral contributes to the main part, and we need to analyse \(g''(r)\) and \(g'''(r)\) in order to show that all our transformations and estimates are valid. For more details on the saddle-point method, we refer the interested reader to Flajolet and Sedgewick [10, Chapter VIII].
The estimates for \(g''(r)\) and \(g'''(r)\) are based on singular analysis using the well-known Mellin transform. The Mellin transform \(h^{*}(s)\) of a function h is defined by
The most important property for our considerations is the so called rescaling rule, which is given by
see [8, Theorem 1]. This provides a link between a generating function and its Dirichlet generating function. For a detailed account on this integral transform, we refer the interested reader to the work of Flajolet, Gourdon and Dumas [8] and to the work of Flajolet, Grabner, Kirschenhofer, Prodinger and Tichy [9].
Let \(\delta >0\). Throughout the rest of our paper we assume \(\delta \le u\le \delta ^{-1}\) and by “uniformly in u” we always mean “uniformly as \(\delta \le u\le \delta ^{-1}\)”. Then in our case we have for the Mellin transform of \(f(\tau ,u)\) with respect to \(\tau \) that
where
is the associated Dirichlet series and
is the Mellin transform of \(\tau \mapsto \left( 1+ue^{-\tau }\right) \).
The central advantage of the Mellin transform is not necessarily the transformation itself but moreover the converse map**, where we consider the singularities of the transformed function providing the asymptotic expansion.
Theorem 3
[Converse Map** [8, Theorem 4]] Let f(x) be continuous in \((0,+\infty )\) with Mellin transform \(f^*(s)\) having a nonempty fundamental strip \(\langle \alpha ,\beta \rangle \). Assume that \(f^*(s)\) admits a meromorphic continuation to the strip \(\langle \gamma , \beta \rangle \) for some \(\gamma <\alpha \) with a finite number of poles there, and is analytic on \(\Re (s)=\gamma \). Assume also that there exists a real number \(\eta \in (\alpha ,\beta )\) such that
with \(r > 1\) as \({\left|s \right|}\rightarrow \infty \) in \(\gamma \le \Re (s)\le \eta \). If \(f^*(s)\) admits the singular expansion
for \(s\in \langle \gamma ,\alpha \rangle \), then an asymptotic expansion of f(x) at 0 is given by
Thus in our case we have to consider the singularities of the associated Dirichlet series D(s) and the function Y(s, u). On the one hand we note that
where m is the integer such that \(m<\beta \le m+1\). Plugging this into (3.4) yields
where \(\tilde{D}(s)\) has no pole with \(\Re (s)>1\) and
is the Riemann zeta function. On the other hand
where
are the polylogarithm and the Gamma function, respectively.
Now in order to apply converse map**, we need to show that (3.6) as well as (3.7) are both fulfilled for these three functions. Stirling’s formula yields for the Gamma function that
for \(a\le x\le b\) and \({\left|y \right|}\ge 1\). Furthermore, the Riemann zeta function satisfies
for suitable \(A=A(a,b)\), \(a\le x\le b\) and \({\left|y \right|}\ge 1\). For the polylogarithm we follow the ideas of Flajolet and Sedgewick [10, VI.8]. This is a good application of the converse map**, so we want to reproduce it here: First of all, let \(w=-\log z\) and define the function
This is a harmonic sum and so we apply Mellin transform theory. The Mellin transform of \(\Lambda (w)\) satisfies
for \(\Re (s)>\max (0,1-\alpha )\). The Gamma function has simple poles at the negative integers and \(\zeta (s+\alpha )\) has a simple pole at \(1-\alpha \). Thus, the application of converse map** (Theorem 3) yields
with
Using these estimates in the converse map**, we obtain an asymptotic formula for \(Q_n(u)\) of the form
Recall that
Using implicit differentiation, we obtain a Taylor expansion for the moment-generating function, which yields
proving the central limit theorem for \(\varpi _n\). Finally, we will use the Chernoff bound for the tail estimates.
4 Proof of the Main Result
To prove Theorem 2, we apply the method we have outlined in the previous section. As indicated above, we choose \(r=r(n,u)\) such that the first derivative in (3.3) vanishes, i.e.,
Since the sum is decreasing in r, we see that this equation has a unique solution, which is the saddle point. The main value of the integral in (3.1) lies around the positive real axis. We set \(t_n=r^{1+3\beta /7}\) and split the integral into two ranges, namely into
where
and
4.1 Estimate of \(I_1\)
We start our considerations with the central integral \(I_1\) and show the following lemma on its asymptotic behavior.
Lemma 4
Let \(B^{2} = f_{\tau \tau }(r,u)\). Then we have
with
uniformly in u.
Recall that by “uniformly in u” we always mean “uniformly as \(\delta \le u\le \delta ^{-1}\)”.
Proof
It holds that
Then from (3.8) we derive
Note that in (4.2) the involved quantities may be complex numbers and the \(\mathcal {O}\)-notation \(A=B+\mathcal {O}(C)\) in this case means that there is a constant \(\gamma >0\) (only depending on \(\beta =1/\alpha \)) such that \({\left|A-B \right|}\le \gamma {\left|C \right|}\).
For \(j\ge 0\), we analogously obtain
All infinite sums in (4.3) are of the form
with \(\gamma > 0\). Let \(H_{\gamma ,j}(s,u)\) denote the Mellin transform of \(h_{\gamma ,j}(\tau ,u)\) with respect to \(\tau \), then \(H_{\gamma ,j}(s,u)\) is given by
The function \(H_{\gamma ,j}(s,u)\) converges for \(\Re s>\gamma +j+2\) and its only pole in the range \(j+\frac{1}{2}\le \Re s\le \gamma +j+2\) is that of \(\zeta (s-\gamma -j)\) at \(s=\gamma +j+1\). The Riemann zeta function and the polylogarithm grow only polynomially, whereas the Gamma function decreases exponentially on every vertical line in the complex plane; see Section 3. Thus, we can apply converse map** (Theorem 3) and obtain
By plugging everything into (4.3), we obtain
For the saddle point n, this results in
whereas the second derivative is given by
For the third derivative occurring in the error term in (4.1), we have
We estimate this expression following [20]: Let \(k_{0} = r^{-(1+c)}\) for some constant \(c > 0\) and write \(v = u^{-1}\) for short. We split the sum into two parts, according to whether \(k \le k_{0}\) or not. For the sum over large k, we obtain
For the remaining sum we note that
Therefore, we get
Using the Mellin transform and converse map**, this results in
By combining this with (4.6), we obtain
for \(\left| t\right| \le r^{1+3\beta /7}\).
All in all, this leads to the expansion
For the integral \(I_1\), we thus obtain
Finally, we change the integral to a Gaussian integral and get
\(\square \)
4.2 Estimate of \(I_{2}\)
Next, we prove the following asymptotic upper bound for the integral \(I_{2}\).
Lemma 5
For \(I_{2}\), it holds that
where \(c_{3}\) is a constant uniformly in u.
For the proof of this estimate, we need the following two lemmas. The first lemma provides an upper bound for some exponential that will occur later on, whereas the second one says that \({\left|Q(e^{-r-it},u) \right|}\) is small compared to \(Q(e^{r},u)\). These results are the main ingredients for the proof of Lemma 5.
Lemma 6
(Li–Chen [17, Lemma 2.5]) Let \(\beta \ge 1\). For \(\sigma >0\), we have
where \(\rho \) is a positive constant depending only on \(\beta \).
Lemma 7
For any real y with \(t_{0}\le {\left|y \right|} \le \pi \), we derive
for some constant \(\rho \) depending only on \(\beta \).
Proof
First of all, we note that
By the mean value theorem, there exists \(\xi \in (k,k+1)\) such that
which leads to
see also Li and Chen [17, Proof of Lemma 2.6]. Moreover, we have
Using this, it holds that
where the last estimate follows by Lemma 6.
Following the lines of Li and Chen [17] again, we further have
for \(t_{n}\le {\left|t \right|}\le \pi \). Since
and \(e^{-r} = 1 - r + \mathcal {O}(r^{2})\), we find
This further implies
This lower bound results in
and finally
for sufficiently large n. So we consequently obtain
completing the proof. \(\square \)
Proof of Lemma 5
By the definition of \(I_{2}\), it holds that
An application of Lemma 7 thus yields
for a certain constant \(c_3\) uniformly in u, as stated. \(\square \)
4.3 Estimate of \(Q_n(u)\) and Moment-Generating Function
After estimating the main term and the contribution away from the real axis, we put (4.8) and (4.10) together and get
The plan for the last part of the proof is to consider the moment-generating function using this asymptotic expansion. This will prove the central limit theorem. Finally, at the end of this section, we use the Chernoff bound in order to obtain the desired tail estimates.
Now we consider the moment-generating function for the random variable \(\varpi _n\) (the number of summands in a random partition of n). To this end, let \(M_n(t)={\mathbb {E}}(e^{(\varpi _n-\mu _n)t/\sigma _n})\), where t is real and \(\mu _n\) and \(\sigma _n\) are the mean and the standard deviation as defined in (2.1) and (2.2), respectively. Then the following estimate holds.
Lemma 8
For bounded t, it holds that
as \(n\rightarrow \infty \).
Proof
First of all, we observe that
Instead of representing the function with respect to u, we interpret \(r=r(n,u)\) as a function of n and u and use implicit differentiation on (4.5) as in Madritsch and Wagner [20], and obtain
and similarly
as well as
We now need estimates for the partial derivatives of f. Estimates for partial derivatives with respect to \(\tau \) follow from our considerations in Section 4.1. For derivatives with respect to u, we take the derivative of the corresponding Mellin transform and then obtain the estimate via converse map** again. Let us exemplarily illustrate this approach for \(f_{u\tau }\): By (4.4), \(f_{\tau }\) is given by
The Mellin transform of \(h_{\beta - \nu , 1}\) is given by
Taking the derivative of \(H_{\beta - \nu , 1}\) with respect to u thus yields
Consequently, converse map** implies for \(f_{\tau u}\) that
In a similar manner, we determine estimates for the other partial derivatives and obtain
From these estimates it follows that \(r_u,r_{uu},r_{uuu}=\mathcal {O}\left( n^{-1/(\beta + 1)}\right) \) uniformly in u. Expanding \(r(n,e^{t/\sigma _n})\) and \(f(r(e^{t/\sigma _n},n),e^{t/\sigma _n})\) around \(t=0\) yields
and
respectively.
By plugging these expansions into the exponential of (4.11), we get
where we have written \(\eta =r(n,1)\) for short. Recalling that \(n=-f_\tau (\eta ,1)\) and that \(r_u(n,1)=-\frac{f_{u\tau }(\eta ,1)}{f_{\tau \tau }(\eta ,1)}\), we can simplify the last expression in order to obtain
In a similar way we get that
Thus, we obtain the following asymptotic formula for the moment-generating function in (4.11):
Recall that we chose \(\mu _{n}\) and \(\sigma _{n}\) in (2.1) and (2.2) such that
By definition of \(\mu _n\) and \(\sigma _n^2\) in (2.1) and (2.2), respectively, we deduce that
for bounded t. \(\square \)
By the previous lemma and Curtiss’ theorem [5], it follows that the distribution of \(\varpi _{n}\) is indeed asymptotically normal. For the remaining parts, we first show that the two asymptotic formulas in (2.1) and (2.2) hold for \(\mu _n\) and \(\sigma _n\), respectively. In particular, we show the existence of two positive constants \(c_1\) and \(c_2\) such that
Our Mellin transform techniques from above show that
and
We may use the identity
to relate these formulas to the Riemann zeta function. Thus we get
and
From (4.5) we get by Lagrange inversion that
and substituting this in (4.12) and (4.13), respectively, yields
We still need to show that \(c_1\) and \(c_2\) are both positive. For \(c_1\) we note that every term \(g(k)/(e^{\eta k}+1)\) is positive and therefore the whole sum is positive. For \(\sigma _n^2\) it is not so obvious that \(c_2\) does not vanish identically. Therefore we consider the numerator and denominator of \(\sigma _n^2\) separately. For the numerator we get
where we have written \(q(x)=\frac{e^x}{(e^x+1)^2}\) for short. Let \(C>1\) be an arbitrary constant. Then we can estimate this by
where we have used that \(g(k)\gg k^{\beta -1}\) by (4.9). For the denominator we already have shown that it is \(\ll \eta ^{-(\beta +2)}\). Thus we have \(\sigma _n^2\gg \eta ^{-\beta }\) and \(c_2>0\).
For the asymptotic equivalences
we apply Hwang’s method used in the proof of Theorem 1 in [14].
Finally we turn our attention to the tails. We again follow Hwang [14] and obtain for \(t = o(n^{\alpha /(6\alpha +6)})\) that
by the Chernoff bound. For the original inequality of Chernoff we refer to [4] and we remark here that Herman Chernoff has celebrated his 100 anniversary on July 1, 2023.
Therefore, let \(T=n^{\beta /(6\beta +6)}/\log n\). Then for \(x\le T\) we set \(t=x\) and obtain
For \(x\ge T\) we set \(t=T\) yielding
We can estimate the probability \({\mathbb {P}}\bigl (\frac{\varpi _{n} - \mu _n}{\sigma _n}\le -x\bigr )\) in a similar way.
References
Balasubramanian, R., Luca, F.: On the number of factorizations of an integer. Integers 11, A12, 5 (2011). (MR 2798647)
Chen, Y.-G., Li, Y.-L.: On the square-root partition function. C. R. Math. Acad. Sci. Paris 353(4), 287–290 (2015). (MR3319122)
Chern, S.: Note on square-root partitions into distinct parts. Ramanujan J. 54(2), 449–461 (2021). (MR4204766)
Chernoff, H.: A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. Math. Statistics 23, 493–507 (1952). (MR57518)
Curtiss, J.H.: A note on the theory of moment generating functions. Ann. Math. Statistics 13, 430–433 (1942). (MR7577)
Debruyne, G., Tenenbaum, G.: The saddle-point method for general partition functions. Indag. Math. (N.S.) 31(4), 728–738 (2020). (MR4126763)
Erdös, P., Lehner, J.: The distribution of the number of summands in the partitions of a positive integer. Duke Math. J. 8, 335–345 (1941). (MR4841)
P. Flajolet, X. Gourdon, and P. Dumas, Mellin transforms and asymptotics: harmonic sums, 1995, pp. 3– 58. Special volume on mathematical analysis of algorithms. MR1337752
Flajolet, P., Grabner, P., Kirschenhofer, P., Prodinger, H., Tichy, R.F.: Mellin transforms and asymptotics: digital sums. Theoret. Comput. Sci. 123(2), 291–314 (1994). (MR1256203)
P. Flajolet and R. Sedgewick, Analytic combinatorics, Cambridge University Press, Cambridge, (2009). MR2483235 (2010h:05005)
Goh, W.M.Y., Schmutz, E.: The number of distinct part sizes in a random integer partition. J. Combin. Theory Ser. A 69(1), 149–158 (1995). (MR1309156)
Granovsky, B.L., Stark, D.: A Meinardus theorem with multiple singularities. Comm. Math. Phys. 314(2), 329–350 (2012). (MR2958955)
Hardy, G.H., Ramanujan, S.: Asymptotic formulae in combinatory analysis. Proc. London Math. Soc. 17, 75–115 (1918)
Hwang, H.-K.: Limit theorems for the number of summands in integer partitions. J. Combin. Theory Ser. A 96(1), 89–126 (2001). (MR1855788)
Ingham, A. E.: A Tauberian theorem for partitions. Ann. of Math 42, 1075–1090 (1941). (MR0005522 (3,166a))
Li, Y.-L., Chen, Y.-G.: On the r-th root partition function. Taiwanese J. Math. 20(3), 545–551 (2016). (MR3511994)
Li, Y.-L., Chen, Y.-G.: On the r-th root partition function, II. J. Number Theory 188, 392–409 (2018). (MR3778641)
Li, Y.-L., Wu, J.: On the kth root partition function. Int. J. Number Theory 17(9), 2071–2085 (2021). (MR4321374)
Luca, F., Ralaivaosaona, D.: An explicit bound for the number of partitions into roots. J. Number Theory 169, 250–264 (2016). (MR3531239)
Madritsch, M., Wagner, S.: A central limit theorem for integer partitions. Monatsh. Math. 161(1), 85–114 (2010). (MR2670233)
Meinardus, G.: Asymptotische Aussagen über Partitionen. Math. Z. 59, 388–398 (1954). (MR62781)
H. Rademacher, On the Partition Function p(n), Proc. London Math. Soc. S2-43 (1937), no. 4, 241. MR1575213
Ralaivaosaona, D.: On the number of summands in a random prime partition. Monatsh. Math. 166(3–4), 505–524 (2012). (MR2925152)
Schmutz, E.: Part sizes of random integer partitions. Indian J. Pure Appl. Math. 25(6), 567–575 (1994). (MR1285219)
Tenenbaum, G., Wu, J., Li, Y.-L.: Power partitions and saddle-point method. J. Number Theory 204, 435–445 (2019). (MR3991428)
Wilf, H.S.: Three problems in combinatorial asymptotics. J. Combin. Theory Ser. A 35(2), 199–207 (1983). (MR712105)
Acknowledgements
The first author is supported by the Austrian Science Fund (FWF), project W 1230. The second author is supported by project ANR-18-CE40-0018 funded by the French National Research Agency. The third author is supported by the Austrian Science Fund (FWF), project F 5510-N26 within the Special Research Area “Quasi-Monte Carlo Methods: Theory and Applications” and project I 4406-N. Major parts of the present paper were established when the first author was visiting the Institut Élie Cartan at the Université de Lorraine, France. He thanks the institution for its hospitality. Finally, the authors thank the reviewers for carefully reading the manuscript and for the helpful suggestions. Their valuable comments improved the quality of the article.
Funding
Open access funding provided by Austrian Science Fund (FWF).
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Ilse Fischer.
Dedicated to Wolfgang M. Schmidt on the occasion of his ninetieth birthday.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Lipnik, G.F., Madritsch, M.G. & Tichy, R.F. A central limit theorem for integer partitions into small powers. Monatsh Math 203, 149–173 (2024). https://doi.org/10.1007/s00605-023-01926-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00605-023-01926-y