Abstract
We prove asymptotic formulas for the complex coefficients of \((\zeta q;q)_\infty ^{-1}\), where \(\zeta \) is a root of unity, and apply our results to determine secondary terms in the asymptotics for p(a, b, n), the number of integer partitions of n with number of parts congruent a modulo b. Our results imply that, as \(n \rightarrow \infty \), the difference \(p(a_1,b,n)-p(a_2,b,n)\) for \(a_1 \ne a_2\) oscillates like a cosine when renormalized by elementary functions. Moreover, we give asymptotic formulas for arbitrary linear combinations of \(\{p(a,b,n)\}_{1 \le a \le b}.\)
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction and statement of results
Let n be a positive integer. A partition of n is a weakly decreasing sequence of positive integers that sum to n. The number of partitions of n is denoted by p(n). For example, one has \(p(4) = 5\), since the relevant partitions are
When \(\lambda _1 + \cdots + \lambda _r = n\), the \(\lambda _j\) are called the parts of the partition \(\lambda = (\lambda _1, \ldots , \lambda _r)\), and we write \(\lambda \vdash n\) to denote that \(\lambda \) is a partition of n. The partition function has no elementary closed formula, nor does it satisfy any finite order recurrence. However, when defining \(p(0) := 1\), its generating function has the following product expansion
where as usual \(q := e^{2\pi i \tau }\) and \(\eta (\tau )\) denotes the Dedekind eta function. In [13], Hardy and Ramanujan used (1.1) to show the asymptotic formula
For their proof they introduced the circle method, certainly one of the most useful tools in modern analytic number theory. The now so-called Hardy–Ramanujan circle method uses modular type transformations to obtain a divergent asymptotic expansion whose truncations approximate p(n) up to small errors. A later refinement by Rademacher [20], exploiting the modularity of \(\eta (\tau )\), provides a convergent series for p(n).
In this work we study the distribution of ordinary partitions whose number of parts are congruent to some residue class a modulo b.Footnote 1 The number of such partitions \(\lambda \vdash n\) is denoted by p(a, b, n).Footnote 2 It is well known that the numbers p(a, b, n) are asymptotically equidistributed; i.e.,
The proof of (1.3) begins by writing the generating function for p(a, b, n) in terms of non-modular eta-products twisted with roots of unity modulo b which is a direct consequence of the orthogonality of roots of unity:
where \((a;q)_\infty := \prod _{n \ge 0} (1-aq^n)\) denotes the usual q-Pochhammer symbol and \(\zeta _b := e^{\frac{2\pi i}{b}}\). Since the first term does not depend on a and dominates the other summands, (1.3) can be seen as a corollary of (1.4). Similar results have also been proved for related statistics. For example, the rank of a partition is defined to be the largest part minus the number of parts; Males [17] showed that the Dyson rank function N(a, b, n) (the number of partitions with rank congruent to a modulo b) is asymptotically equidistributed. Males’ proof uses Ingham’s Tauberian theorem [15] and exploits the modularity of the generating function of N(a, b, n), which is given in terms of twisted generalizations of one of Ramanujan’s famous mock theta functions. In contrast, the twisted eta-products in (1.4) lack modularity.
If we now consider differences, \(p(a_1,b,n)-p(a_2,b,n)\), the main terms in (1.4) cancel and the behavior must be determined by secondary terms. In the following example we look at the differences of two modulo 5 partition functions (Fig. 1).
Example 1.1
Consider the case \(a_1 = 1\), \(a_2 = 4\) and \(b = 5\). The q-series of the differences has the following oscillating shape
Our first result predicts this oscillation as follows. As usual, we define the dilogarithm for \(|z|\le 1\) by the generating series
Throughout we use the principle branch of the complex square root and logarithm.
Theorem 1.2
Let \(b \ge 5\) be an integer. Then for any two residue classes \(a_1 \not \equiv a_2 \pmod {b}\), we have
as \(n \rightarrow \infty \), whereFootnote 3\(\lambda _1 + i\lambda _2 := \sqrt{\mathrm {Li}_2(\zeta _b)}\) and \(B > 0\) and \(0 \le \beta < 2\pi \) are implicitly defined by
A more general version of Theorem 1.2 holds for values \(b \ge 2\), see Theorem 3.5, where the special cases \(b \in \{2,3,4\}\) have to be treated slightly differently. Figure 2 shows that this prediction is surprisingly accurate even for small n.
The proof makes use of (1.4) and a detailed study of the coefficients \(\sum _{n \ge 0} Q_n(\zeta )q^n := (\zeta q; q)^{-1}_\infty \) when \(\zeta \) is a root of unity. Prompted by a question of Stanley, a study of the polynomials \(Q_n(\zeta )\) and their complex zeroes was undertaken in a series of papers by Boyer, Goh, Keith and Parry (see [4,5,6,7, 18]), and the functions \((\zeta q; q)^{-1}_\infty \) have also been studied in recent work of Bringmann, Craig, Males, and Ono [8] in the context of distribution of homology of Hilbert schemes and t-hook lengths. Asymptotics for \(Q_n(\zeta )\) were studied by Wright [24] when \(\zeta \) is any positive real number, and then by Boyer and Goh [4, 5] for \(|\zeta |\ne 1\). Our results essentially complete this study, proving asymptotics when \(\zeta \) is any root of unity.
We use the circle method in the form of Parry [18] as a template; however, significant technical effort is required to bound minor arcs that one does not encounter when \(|\zeta |\ne 1\). For example, we have to overcome the fact that when \(\zeta \) is a root of unity, the series representation of the polylogarithm \(\mathrm {Li}_s(\zeta )\) does not converge for \(\mathrm {Re}(s) < 0\).
Asymptotics in the case that \(b \ge 5\) are as follows, and a general version with the sporadic cases \(b \in \{2,3,4\}\) is stated in Theorem 3.2.
Theorem 1.3
Let \(b \ge 5\). Then we have
Remark 1.4
Our techniques for bounding minor arcs seem not to readily apply when \(|\zeta |=1\) and \(\zeta \) is not a root of unity, so we leave it as an open problem to prove asymptotic formulas for \(Q_n(\zeta )\) in this case. Boyer and Goh [4] prove that the unit circle is part of the zero attractor of the polynomials \(Q_n(\zeta )\), and it follows from their results that asymptotic formulas for \(Q_n(\zeta )\) cannot be uniform on any subset of \(\mathbb {C}\) which is an open neighborhood of an arc of the unit circle.
Furthermore, note that taking \(\zeta \rightarrow 1\) in Theorem 1.3 does not recover the Hardy–Ramanujan asymptotic formula (1.2).
The above results can be further developed to linear combinations of p(a, b, n) (where b is fixed). Each relevant combination \(\sum _{0 \le a < b} c_a p(a,b,n)\) corresponds to a polynomial \(P(x) := \sum _{0 \le j < b} c_a x^a\) via \(p(a,b,n) \mapsto x^a\). Perhaps the most combinatorially interesting cases are \(c_a \in \{0, \pm 1 \}\); i.e., differences of partition numbers. This means that for any two nonempty disjoint subsets \(S_1, S_2 \subset [0, b-1]\) of integers, we consider the differences
The asymptotic behavior of these differences is described in Theorem 3.7. When choosing the coefficients \(c_a\) properly we can reduce the growth of the difference terms by canceling main terms. By doing so, we see that actually all formulas of Theorem 1.3 are required (as well as the sporadic cases described in Theorem 3.2). In contrast, one can deduce formula (1.3) by only elementary means without a thorough analysis of the coefficients \(Q_n(\zeta )\).
Moreover, for families of partition numbers, one can consider growth and sign changes simultaneously. Of special interest here is the fact that any shift of \((S_1, S_2)\) to \((S_1+r,S_2+r)\) changes the “phase” but not the “amplitude” of the asymptotic terms. The following example demonstrates this fact.
Example 1.5
Let \(b = 12\). For the sets \(S_1 := \{1,2,5\}\) and \(S_2 := \{0,3,4\}\), we find \(P_{S_1, S_2}(x) = x^5-x^4-x^3+x^2+x-1= (x-1)\Phi _{12}(x)\), where \(\Phi _{12}(x)\) is the 12th cyclotomic polynomial. The corresponding difference of partition numbers is
By shifting the sets with integers \(0 \le r \le 6\), we find that, more generally, all differences
have the same growth in their amplitudes but have different phases of sign changes. Since \( P_{S_1, S_2}(x)\) has zeros \(\{1, \pm \zeta _{12}, \pm \zeta ^5_{12}\}\), the dominating term in the asymptotic expansion is induced by the root of unity \(\zeta _6\). In fact, we obtain
with \(\lambda _1 + i\lambda _2 = \sqrt{\mathrm {Li}_2(\zeta _6)}\), where \(A > 0\) and \(\alpha \in [0,2\pi )\) are defined by
Note that A, \(\alpha \), \(\lambda _1\) and \(\lambda _2\) all do not depend on the choice of r. One can then asymptotically describe the regions of n, where
and vice versa, using formula (1.5). Additionally, since \(\mathrm {Re}(\sqrt{\mathrm {Li}_2(\zeta _6)}) < \mathrm {Re}(\sqrt{\mathrm {Li}_2(\zeta _{12})})\), we note with the help of Theorem 1.2 that
This implies some form of cancellation within the higher differences \(\Delta _r(n)\), that “exceeds” that of simple differences modulo 12.
In contrast to Example 1.5, when b is prime, one cannot decrease the order of growth below simple differences using any rational combination of the p(a, b, n). This is shown in Section 3.
The paper is organized as follows. In Section 2, we collect some classic analytical tools and prove some key lemmas. This includes a careful study of the dilogarithm function \(\mathrm {Li}_2(z)\) for values \(|z|=1\). In Section 3, we state our main result, Theorem 3.2 and applications. We prove Theorem 3.2 in Sections 4 and 5 using the circle method. Section 5 deals with the primary difficulty of bounding the minor arcs.
The first author is partially supported by the SFB/TRR 191 “Symplectic Structures in Geometry, Algebra and Dynamics”, funded by the DFG (Projektnummer 281071066 TRR 191).
The second author is partially supported by the Alfried Krupp prize.
2 Preliminaries
We will need several analytical results in this work, which we collect in this section. Much of the items here are discussed in works such as [9,10,11, 16, 19, 22]. The reader can skip this section and refer back to it as needed as we work through the proofs of our main theorems.
2.1 Classical asymptotic analysis and integration formulas
A first tool is the well-known Laplace’s method for studying limits of definite integrals with oscillation, which we will use for evaluating Cauchy-type integrals.
Theorem 2.1
(Laplace’s method, see Section 1.1.5 of [19]) Let \(A,B: [a,b]\rightarrow \mathbb {C}\) be continuous functions. Suppose \(x\ne x_0 \in [a,b]\) such that \(\mathrm {Re}(B(x))<\mathrm {Re}(B(x_0)),\) and that
with \(\mathrm {Re}(k)>0.\) Then as \(t \rightarrow \infty \)
We are ultimately interested in how the coefficients of a series \(S(q):= \sum _{n\ge 0}a(n)q^n\) grow as \(n\rightarrow \infty \). The classical Euler–Maclaurin summation formulas can be applied in many cases to link the growth of a(n) to the growth of S(q) as q approaches the unit circle. We state the Euler–Maclaurin summation formulas in two different forms.
Theorem 2.2
(classical Euler–Maclaurin summation, see p. 66 of [16]) Let \(\{x\}:=x - \lfloor x \rfloor \) denote the fractional part of x. For \(N \in \mathbb {N}\) and \(f:[1, \infty ) \rightarrow \mathbb {C}\) a continuously differentiable function, we have
We use a second formulation, due to Bringmann–Mahlburg–Jennings-Shaffer, to study the asymptotics of series with a complex variable approaching 0 within a fixed cone in the right-half plane. It is not stated in [10], but one can conclude from the proof that Theorem 2.3 is uniform in \(0 \le a \le 1.\)
Theorem 2.3
(uniform complex Euler–Maclaurin summation, [10], Theorem 1.2) Suppose \(0\le \theta < \frac{\pi }{2}\) and suppose that \(f:\mathbb {C}\rightarrow \mathbb {C}\) is holomorphic in a domain containing \(\{re^{i\alpha }: |\alpha | \le \theta \}\) with derivatives of sufficient decay; i.e., there is an \(\varepsilon >0\) such that for all m \(f^{(m)}(z) \ll z^{-1-\varepsilon }\) as \(z \rightarrow \infty \). Then uniformly for \(a \in [0,1]\), we have
uniformly as \(w \rightarrow 0\) in \(\mathrm {Arg}(w)\le \theta \).
To identify a constant term in our asymptotic formula, we cite the following integral calculation of Bringmann, Craig, Males and Ono.
Lemma 2.4
([8], Lemma 2.3) For \(a \in \mathbb {R}^+,\)
Finally, we will use Abel partial summation extensively when bounding the twisted eta-products on the minor arcs.
Proposition 2.5
(Abel partial summation, see p. 3 of [23]) Let \(N \in \mathbb {N}_0\) and \(M \in \mathbb {N}\). For sequences \(\{a_n\}_{n \ge N}\), \(\{b_n\}_{n \ge N}\) of complex numbers, if \(A_n:=\sum _{N < m \le n} a_m,\) then
2.2 Elementary bounds
The following bound for differences of holomorphic functions will be used in conjunction with Abel partial summation during the course of the circle method. The proof of the following is a straightforward application of the fundamental theorem of calculus and the maximum modulus principle.
Lemma 2.6
Let \(f : U \rightarrow \mathbb {C}\) be a holomorphic function and \(\overline{B_r(c)} \subset U\) a compact disk. Then, for all \(a,b \in B_r(c)\) with \(a \not = b\), we have
We also need the following elementary maximum; for a proof see [18], Lemma 5.2.
Lemma 2.7
For \(a \in \left( -\frac{\pi }{2}, \frac{\pi }{2}\right) \) and \(b \in \mathbb {R}\), we have
with equality if and only if b satisfies \(\mathrm {Arg}(1+ib)=\frac{a}{2}.\)
2.3 Bounds for trigonometric series and the polylogarithm
We recall that for complex numbers s and z with \(|z| < 1\) the polylogarithm \(\mathrm {Li}_s(z)\) is defined by the series
We are especially interested in the case \(s=2\), where \(\mathrm {Li}_2(z)\) is called the dilogarithm. The appendix of a recent preprint of Boyer and Parry [7] contains many useful results on the dilogarithm, including the following key lemma.
Lemma 2.8
(Proposition 4, [7]) The function \(\theta \mapsto \mathrm {Re} \left( \sqrt{\text {Li}_2(e^{2\pi i \theta })}\right) \) is decreasing on the interval \([0,\frac{1}{2}].\)
We also need to consider the derivative of the function \(\theta \mapsto \mathrm {Li}_2(e^{2\pi i\theta })\) and its partial sums. Let
Then the following bound holds.
Lemma 2.9
We have, uniformly for \(0< \theta < 1\),
Proof
Note that we have
and as it is well known that \(\sum _{1 \le m \le M} \frac{\sin (2\pi \theta m)}{m}\) is uniformly bounded in \(\mathbb {R}\) (see [21] on p. 94) we are left with the cosine sum. Let \(0 < \theta \le \frac{1}{2}\) and \(M \in \mathbb {N}\). Consider the meromorphic function
together with the rectangle \(R_M\) with vertices \(\frac{1}{2}-iM,\frac{1}{2}+ \frac{i}{\theta }\), \(\frac{i}{\theta } + M + \frac{1}{2}\), and \(-iM + M + \frac{1}{2}\). Notice that in a punctured disk of radius \(r<1\) centered at \(k\ge 1\), we have
With the residue theorem we find
where the contour is taken once in positive direction. By the invariance of the function under the reflection \(\theta \rightarrow 1 - \theta \), it suffices to consider values \(0 < \theta \le \frac{1}{2}\). A straightforward calculation shows that the bottom side integrals are bounded uniformly in \(0 < \theta \le \frac{1}{2}\). Similarly, also using that \(\cot (\pi z)\) is uniformly bounded on lines \(\{\mathrm {Re}(z) \in \frac{1}{2} \mathbb {Z}\setminus \mathbb {Z}\}\) for the second part, one argues
A similar argument yields
For the rectangle top, note with the use of the substitution \(z \mapsto \frac{z}{\theta }\) we have
With the Residue Theorem we obtain
and the bound \(\cos (2\pi z)(\cot \left( \frac{\pi z}{\theta }\right) +i)= O(e^{-2\pi \mathrm {Im}(z)})\) as \(\mathrm {Im}(z) \rightarrow \infty \) (since \(0 < \theta \le \frac{1}{2}\)) yields the uniform boundedness of the first integral in (2.1). The integral on the right-hand side of (2.1) can be bounded via standard contour integration, for instance, by using that \(\int _\alpha ^\infty \frac{\cos (x)}{x} dx \ll 1\) for all \(\alpha \ge 1\). This completes the proof. \(\square \)
Lemma 2.9 has the following important consequence.
Lemma 2.10
Let a, b, h and k be positive integers, such that \(\gcd (a,b) = \gcd (h,k) = 1\). We assume that a and b are fixed. Then we have
as \(k \rightarrow \infty \), uniformly in h.
Proof
The assumption \(\gcd (h,k)=1\) implies that the map \(j \mapsto hj\) is a bijection modulo k. One can show by elementary means that there is at most one \(j_0\) such that bk divides \(ak+bj_0h\). First, we assume that such a \(j_0\) exists. Using \(G_m(x+1)=G_m(x)\), we first reorder the sum, then apply Lemma 2.9 to obtain
by Stirling’s formula. Now, assume that there is no such \(j_0\). In this case we find \(0< \alpha _{a,b,k} < b\), such that
Using again Lemma 2.9 and Stirling’s formula, we obtain
Since clearly
the lemma follows. \(\square \)
3 Main results and applications
3.1 Twisted eta-products
In this section, we record the general asymptotic formula for \(Q_n(\zeta )\) where \(\zeta \) is any root of unity. Note that \(\overline{Q_n(\zeta )}=Q_n(\overline{\zeta })\), so it suffices to find asymptotic formulas for \(\zeta \) in the upper-half plane. The following theorem of Boyer and Goh [4] regarding the dilogarithm distinguishes several cases in our main theorem. Following [4], we define
and
where each \(\theta _{jk}\) is a solution to \(\Psi _j\left( \theta \right) =\Psi _k\left( \theta \right) \). Here,
Since the values \(\theta _{13}\) and \(\theta _{23}\) arise as solutions to a non-algebraic equation, it is very unlikely that they are rational multiples of \(\pi \). Therefore, we will no longer consider them in future investigations.
Theorem 3.1
([4], discussion prior to Theorem 2) For \(0\le \theta \le \pi \), we have
Following [18], define
We have the following asymptotic formulas.
Theorem 3.2
(1) If \(2\pi \frac{a}{b}\in (0,\theta _{13}),\) then
(2) If \(2\pi \frac{a}{b}\in (\theta _{23},\pi ),\) then
(3) If \(2\pi \frac{a}{b}\in (\theta _{13},\theta _{23})\setminus \left\{ \frac{2\pi }{3}\right\} ,\) then
(4) We have
We prove Theorem 3.2 in Sections 4 and 5.
Remark 3.3
Recall that we have the asymptotic formula (1.2) for \(Q_n(1)=p(n)\), whereas for \(Q_n(-1)\), standard combinatorial methods give
where \(p_{\mathcal{DO}\mathcal{}}(n)\) counts the number of partitions of n into distinct odd parts. An asymptotic formula for \(p_{\mathcal{DO}\mathcal{}}(n)\) can be worked out using standard techniques. For example, Ingham’s Tauberian theorem (see [10], Theorem 1.1) with the modularity of the Dedekind \(\eta \)-function yields
Note the lack of uniformity in the asymptotic formulas for \(\zeta \) near \(\pm 1\); in particular, the asymptotic formulas for \(Q_n(1)\) and \(Q_n(-1)\) cannot be obtained by taking \(\frac{a}{b} \rightarrow \pm 1\) in cases (1) and (2).
3.2 Applications to differences of partition functions
In this section, we apply Theorem 3.2 to differences of the partition functions p(a, b, n), partitions of n with number of parts congruent to a modulo b. The following elementary proposition relates the numbers p(a, b, n) to the coefficients \(Q_n( \zeta _b^{j})\).
Proposition 3.4
We have
Proof
Using orthogonality, we can write the indicator functions of congruence classes as
and by standard combinatorial techniques (see [1], Ch. 1) one has
Hence,
which completes the proof. \(\square \)
Thus, asymptotics for differences of p(a, b, n) can be identified using the asymptotic formulas found for \(Q_n(\zeta )\) in Theorem 3.2, in particular the equidistribution of the largest part in congruence classes follows immediately: \(\frac{p(a,b,n)}{p(n)} \sim \frac{1}{b}.\) Furthermore, using the Hardy–Ramanujan–Rademacher exact formula for p(n) ( [1], Theorem 5.1) with Theorem 3.2, one can improve this in the various cases. For example, for \(b \ge 5,\) we have
where \(\lambda _1+i\lambda _2=\sqrt{\mathrm {Li}_2( \zeta _b)},\) \(A \ge 0,\) and \(\alpha \in [0,2\pi )\) are defined by
We record a number of results below in the same vein. Considering simple differences, \(p(a_1,b,n)-p(a_2,b,n),\) it follows from Proposition 3.4 that when rewriting each p(a, b, n) in terms of \(Q_n\) the two summands \(Q_n(1)=p(n)\) cancel. With a few exceptions for \(b=4\), the dominant terms are always \(Q_n(\zeta _b)\) and \(Q_n(\zeta _b^{b-1})\).
Theorem 3.5
Let \(0 \le a_1 < a_2 \le b-1.\)
(1) For \(b=2,\) we have \(p(0,2,n)-p(1,2,n)=Q_n(-1).\)
(2) For \(b=3\), we have
where \(A_{a_1,a_2} \ge 0\) and \(\alpha _{a_1,a_2} \in [0,2\pi )\) are defined by
(3) For \(b=4,\) and \(a_1,a_2\) of opposite parity, we have
(4) For \(b \ge 5\), or for \(b=4\) and \(a_1,a_2\) of the same parity, we have
where \(\lambda _1+i\lambda _2=\sqrt{\mathrm {Li}_2( \zeta _b)}\), \(B_{a_1,a_2,b} \ge 0\) and \(\beta _{a_1,a_2,b} \in [0,2 \pi )\) are defined by
Proof
When \(b=2\), Theorem 3.5 follows from Proposition 3.4. Let \(b \ge 5.\) By Proposition 3.4, it follows that
Upon dividing both sides by \(B_{a_1,a_2,b} n^{-\frac{3}{4}} \exp (2\lambda _1\sqrt{n})\), Lemma 2.8 implies that the sum on the right is \(O(e^{-c\sqrt{n}})\), for some \(c>0,\) and it then follows from Theorem 3.2 that
which gives the claim of Theorem 3.5.
The other cases are proved similarly by noting that Lemma 2.8 and Theorem 3.2 imply that the \(Q_n( \zeta _b)\) and \(Q_n( \zeta _b^{-1})\) terms always dominate \(Q_n( \zeta _b^{j})\) for \(j \ne \pm 1,\) except in the case that \(b=4\), where \(Q_n(-1)\) dominates when \(a_1,a_2\) have opposite parity. But \(Q_n(-1)\) vanishes from the sum in Proposition 3.4 when \(b=4\) and \(a_1,a_2\) have the same parity, which leads to the third case in Theorem 3.5. \(\square \)
More generally, if \(P_{{\textbf {v}}}(x):=\sum _{0 \le a \le b-1} v_ax^a \in \mathbb {R}[x]\) with \({\textbf {v}}:= (v_0, \ldots ,v_{b-1})\in \mathbb {R}^b\), then Theorem 3.2 implies asymptotic formulas for any weighted count \( \sum _{a=0}^{b-1}v_ap(a,b,n). \) To state our general theorem, we let
Let \(\mathcal {Z}(P_{{\textbf {v}}})\) be the roots of \(P_{{\textbf {v}}}\), and let \(\lambda _1+i\lambda _2=L( \zeta _b^{a_0})\) for \(a_0 \le \frac{b}{2}\), whenever
Theorem 3.6
With notation as above, we have the following asymptotic formulas.
(1) If \(a_0=0,\) then \(\sum _{0 \le a \le b-1} v_ap(a,b,n) \sim \frac{P_{{\textbf {v}}}(1)}{b}p(n).\)
(2) If \(0< 2 \pi \frac{a_0}{b} < \theta _{13},\) then
where \(A_{a_0,b,{\textbf {v}}} \ge 0\) and \(\alpha _{a_0,b,{\textbf {v}}} \in {[}0,2\pi )\) are defined by
(3) If \(\theta _{13}< 2 \pi \frac{a_0}{b} < \theta _{23}\) and \(a_0 \ne \frac{b}{3},\) then
where \(B_{a_0,b},C_{a_0,b} \ge 0\) and \(\beta _{a_0,b},\gamma _{a_0,b} \in [0,2\pi )\) are defined by
(4) If \(a_0=\frac{b}{3}\), then
where \(D_{{\textbf {v}}} \ge 0\) and \(\delta _{{\textbf {v}}} \in [0,2\pi )\) are defined by
(5) If \(\theta _{23}< 2 \pi \frac{a_0}{b} < \pi \), then
(6) If \(a_0=\frac{b}{2},\) then \(\sum _{0 \le a \le b-1} (-1)^a v_ap(a,b,n) \sim \frac{P_{{\textbf {v}}}(-1)}{b}Q_n(-1).\)
Proof
Theorem 3.6 is proved similarly to Theorem 3.5. For Cases (1) and (6), the asymptotic formula for \(Q_n(1) \sim p(n)\) and Proposition 3.4 directly implies
for Cases (1) and (6), respectively.
For Cases (2), (3) and (5), the asymptotic main term (using that \(\overline{Q_n(\zeta )} = Q_n(\overline{\zeta })\)) is
The proof then follows by applying Theorem 3.2 and dividing by the appropriate normalizing factors in analog to Equation (3.1).
For case (4), there is only one main term in the sum for
Applying Theorem 3.2 and the analog to Equation (3.1) again proves the claim. \(\square \)
One application of the above theorem generalizes Theorem 3.5 to differences of partitions with number of parts modulo b in one of two disjoint sets of residue classes \(S_1, S_2 \subset [0,b-1]\). That is, we consider
and prove a more explicit version of Theorem 3.6 in this case. Since \(P_{S_1,S_2}(x)\) is a polynomial of degree at most \(b-1\) with integer coefficients, there must exist some \(d \mid b\) such that \( \zeta _d \notin \mathcal {Z}(P_{S_1,S_2});\) otherwise, \(P_{S_1,S_2}\) would be divisible by \(\prod _{d \mid b} \Phi _{d}(x)=x^b-1,\) where \(\Phi _d\) is the d-th cyclotomic polynomial, a contradiction.
Theorem 3.7
Let \(b \ge 2\) and let \(S_1, S_2 \subset [0,b-1]\) be disjoint subsets of integers. If \(|S_1| \ne |S_2|,\) then
Otherwise, if \(|S_1|=| S_2|\), then we have the following cases. Let \(d_0\) be the largest integer such that \(d_0 \mid b\) and \( \zeta _{d_0} \notin \mathcal {Z}(P_{S_1,S_2}).\)
(1) If \(d_0\ge 5\) or if \(d_0=4\) and \(-1 \in \mathcal {Z}(P_{S_1,S_2})\), then
where \(\lambda _1+i\lambda _2=\sqrt{\mathrm {Li}_2( \zeta _{d_0})}\), \(A_{d_0,S_1,S_2}\ge 0\) and \(\alpha _{d_0,S_1,S_2} \in [0,2\pi )\) are defined by
(2) If \(d_0=4\) or 3 with b even, and \(-1 \notin \mathcal {Z}(P_{S_1,S_2})\), we have the following allowable sets:
-
If \(d_0 = 4\) and \((k_1+k_2)\not \equiv 0 \pmod {2}\),
$$\begin{aligned} S_1\times S_2&= \{a: a\le b-1, \; a\equiv k_1 \pmod {4}\}\times \{a: a\le b-1, \; a\equiv k_2 \pmod {4}\}. \end{aligned}$$ -
If \(d_0=3\), b is even and \(k_1 \not \equiv k_2 \pmod {2},\)
$$\begin{aligned} S_1\times S_2&= \{a: a\le b-1,\; a\equiv k_1 \pmod {2}\}\times \{a: a\le b-1,\; a\equiv k_2 \pmod {2}\}. \end{aligned}$$
The asymptotic formulas are then given by
where
(3) If \(d_0=3\), b is even and \(-1 \in \mathcal {Z}(P_{S_1,S_2})\), or \(d_0=3\) and b is odd, we have the following sets \(S_1\) and \(S_2\):
-
If b is odd, \(S_1\) and \(S_2\) must contain distinct residue classes modulo 3.
-
If b is even,
$$\begin{aligned} S_1\times S_2&= \{a: a\le b-1,\; a\equiv k_1 \;\text {or}\; k_2 \pmod {6}\}\times \{a: a\le b-2,\; a\equiv k_3\; \text {or}\; k_4 \pmod {6}\}, \end{aligned}$$where
$$\begin{aligned} (k_1,k_2,k_3,k_4)&= (0,3,2,5),\; (2,5,0,3),\; (1,4,2,5),\; (2,5,1,4), (1,3,1,4),\; \text {or}\; (1,4,1,3). \end{aligned}$$
The asymptotic formula is then given by
(4) If \(d_0=2,\) then for some \(a_1, a_2\) of opposite parity we have
and
Proof sketch of Theorem 3.7
The asymptotic analysis is similar to the proof of Theorem 3.5, since Lemma 2.8 and Theorem 3.2 imply that the sequence \(Q_n( \zeta _d)\), ranked from in asymptotic order from least to greatest, is
Thus, for example in case (3), the asymptotic behavior of \(\sum _{a \in S_1} p(a,b,n) - \sum _{a \in S_2} p(a,b,n)\) is determined by \(Q_n( \zeta _3)\) and \(Q_n( \zeta _3^{-1})\) since all other \(Q_n( \zeta _b^a)\) vanish in \(P_{S_1,S_2}( \zeta _{b}^{-j})Q_n( \zeta _b^{j})\). Furthermore, in this case we must have
and \(\deg (P_{S_1,S_2}(x))\le b-1\). Since
this leads directly to the possible sets \(S_1\) and \(S_2\) described in case 3. Finally, note that, given \(S_1\) and \(S_2\) defined in terms of \(a_1\) and \(a_2\) modulo b, we have
This is taken into account in the definition of the constant \(B_{S_1,S_2}.\) The other cases are proved similarly. \(\square \)
We make a few remarks.
Remark 3.8
(1) Theorem 3.7 case (1), in combination with Lemma 2.8, shows that one can reduce the growth of the amplitudes in the differences exponentially, as long as the corresponding polynomial \(P_{S_1, S_2}\) vanishes at the crucial roots of unity. But the options for such types of cancellation strongly depend on b. For example, if b is a prime number, there is not even a rational combination (except for the trivial combination) such that the amplitudes of \(\sum _{0 \le a < b} v_a p(a,b,n)\) grow exponentially less than any simple difference \(p(a_1,b,n) - p(a_2,b,n)\). The simple algebraic reason behind this is that the minimal polynomial of \(\zeta _b\) has degree \(b-1\) in this case. It would be interesting to find a purely combinatorial interpretation for this fact.
(2) Note that if we shift the residue classes in \(S_1\) and \(S_2\) by some integer r and then take least residues modulo b to compute \(P_{S_1+r,S_2+r}(x)\), then this polynomial has the same roots of unity as \(P_{S_1,S_2}(x)\), and so
always has the same asymptotic behavior in Theorem 3.7 as \(\sum _{a \in S_1}p(a,b,n)-\sum _{a \in S_2}p(a,b,n).\) At the same time, the phase in the cosine changes. Indeed, we obtain
where all the constants are the same as in Theorem 3.7 (1). One can further use trigonometric identities to obtain a wider class of more classical asymptotic formulas, for instance regarding squared partition differences. Indeed, if \(4|d_0\) in (3.2), one finds using \(\sin ^2(x) + \cos ^2(x) = 1\), as \(n \rightarrow \infty \),
(3) Cases 3 and 4 in Theorem 3.7 show that for \(d_0\in \{2,3\}\), there are finitely many sets \(S_1\) and \(S_2\) such that the asymptotic behavior of \(\sum _{a \in S_1}p(a,b,n)-\sum _{a \in S_2}p(a,b,n)\) is determined by \(Q_n( \zeta _{d_0})\), and that the number of such sets is independent of b. In fact this is true for any \(d_0\), and we leave it as an open problem to describe the sets \(S_1,S_2\) in general. The sets \(S_1\) and \(S_2\) need not each consist of one congruence class each modulo \(d_0,\) for example with \(b=10\), the polynomial \(P_{\{1,3,6,8\},\{0,2,5,7\}}(x)\) has \(d_0=5.\)
3.3 Examples
In this section, we provide some examples.
Example 3.9
Let \(b=6\), and consider the difference \(p(1,6,n) - p(5,6,n)\). Then according to Theorem 3.5, we obtain
where \(\lambda _1 + i\lambda _2 = \sqrt{\mathrm {Li}_2(\zeta _6)}\), and \(B > 0\) and \(\beta \in [0, 2\pi )\) are given implicitly by
Note that this implies (choosing B to be the absolute value of the right-hand side of the equation above)
Considering the first 900 coefficients numerically yields
which are the highest indices until a change of signs in the sequence \(p(1,6,n) - p(5,6,n)\). We can compare this exact result to the prediction of formula (3.3). By considering the roots of the cosine, we find that it changes signs approximately at
Note that in the first eleven cases, only case two with 27 and case eleven with 777 give slightly wrong predictions (Figs. 3 and 4).
The next example refers to higher differences of partition functions.
Example 3.10
Again, we consider the case \(b=6\). In the spirit of Theorem 3.7 we want to consider multi-termed differences. To do so, we need two subsets \(S_1, S_2 \subset \mathbb {Z}/6\mathbb {Z}\), such that the corresponding nontrivial polynomial \(P_{S_1, S_2}(x)\) of degree at most 5 vanishes at as many roots of unity around \(x=1\) as possible. We first note that
In this case, we obtain a weighted difference and no subsets can be found for a growth reduction to an exponent induced by \(\mathrm {Li}_2(\zeta _3)\). We continue by trying to eliminate also the 3rd roots of unity; i.e., with
This is exactly the case (4) of Theorem 3.7. As a result, setting \(S_1 := \{1,3,5\}\) and \(S_2 := \{0,2,4\}\), we find, as \(n \rightarrow \infty \),
Also note that \(\frac{\pi }{\sqrt{6}} = 1.2825 \ldots \) is much smaller than the exponent \(2\lambda _1 = 1.6281 \ldots \) in (3.3), compare also (3.4).
Finally, we give an application of Remark 3.8.
Example 3.11
In light of Equation (3.2), we can choose r such that the cosine becomes a sine on the right-hand side. Using Pythagoras’ Theorem, and considering the case \(b=8\) and \(r=2\), we obtain an asymptotic formula without oscillating terms. Indeed, according to Theorem 3.5 (4) and Remark 3.8, respectively, we obtain for residue classes \(a_1 \not = a_2\) that
There is no difficulty to extend this type of asymptotic formula for higher differences in the spirit of Theorem 3.7 (1).
4 Proof of Theorem 3.2
Since the asymptotic formulas for \(Q_n(1)\) and \(Q_n(-1)\) are well-known, we assume throughout that \(1 \le a < \frac{b}{2}\) with \(\gcd (a,b)=1\) and \(b \ge 3,\) since \(\overline{Q_n(\zeta )} = Q_n(\overline{\zeta })\).
The setup follows the standard Hardy–Ramanujan circle method, expressing \(Q_n(\zeta )\) as a contour integral about 0 and breaking the contour apart with the sequence of Farey fractions of order N. For facts about the Farey sequence, we refer the reader to Chapter 3 of [14]. Much of the analysis in this section closely follows [18] after assuming the technical Lemmas 4.2 and 4.3 which we prove in the next section.
Let \(N=\lfloor \delta \sqrt{n} \rfloor \), for some \(\delta >0\) to be chosen independently of n and small enough during the course of the proof. Let \(\mathcal {F}_N\) be the sequence of Farey fractions of order N with mediants \(\theta _{h,k}'\) and \(\theta _{h,k}''\) at \(\frac{h}{k}\). We write
with \(k_0 \in \{1,2,3\}\) according to whether we are in case (1), (2) or (3).
By Cauchy’s integral formula, we have
where
We will show that the integral(s) where \(k=k_0\) dominate, that is they are the major arcs, and all the other integrals are exponentially smaller, that is they are minor arcs. The \(E_{h,k}\) will be shown to be error terms on all arcs; the following gives the growth of the \(E_{h,k}\) up to o(1) on each of the possible major arcs.
Lemma 4.1
(1) For \(2\pi \frac{a}{b} \in (0, \theta _{13})\) and \(-\theta _{0,1}' \le \theta \le \theta _{0,1}''\), we have
(2) For \(2\pi \frac{a}{b} \in (\theta _{23}, \pi )\) and \(-\theta _{1,2}' \le \theta \le \theta _{1,2}''\), we have
(3) For \(2\pi \frac{a}{b} \in (\theta _{13},\theta _{23})\setminus \left\{ \frac{2\pi }{3}\right\} \) and \(-\theta _{1,3}' \le \theta \le \theta _{1,3}''\), we have
and for \(-\theta _{2,3}' \le \theta \le \theta _{2,3}''\), we have
(4) For \(\frac{a}{b}=\frac{1}{3}\) and \(-\theta _{1,3}' \le \theta \le \theta _{1,3}''\), we have
and for \(-\theta _{2,3}' \le \theta \le \theta _{2,3}''\), we have
The next two lemmas give uniform bounds on \(E_{h,k}\) to be applied on the minor arcs. The proofs are quite intricate and are provided in the next section. We assume throughout that \(0<\varepsilon \le \frac{1}{4}\).
Lemma 4.2
Uniformly for \(k \le n^{\varepsilon }\) and \(-\theta _{h,k}' \le \theta \le \theta _{h,k}''\), we have
The next lemma treats the case of large denominators.
Lemma 4.3
Uniformly for \(k \ge n^{\varepsilon }\) and \(-\theta _{h,k}' \le \theta \le \theta _{h,k}''\), we have
We postpone the proofs of Lemmas 4.1–4.3 until Section 5. With these key lemmas in hand, the proof of Theorem 3.2 follows [18] closely.
Proof of Theorem 3.2
Cases (1), (2) and (3). Assume \(\frac{a}{b} \ne \frac{1}{3}.\) We write
It follows from the choice \(0 < \varepsilon \le \frac{1}{4}\), Lemmas 4.2 and 4.3 that \(E_{h,k}(\zeta _b^a,t_{\theta })=\delta O(\sqrt{n})\) uniformly. Using this and Lemma 4.1, we have
Recalling (4.1), we rewrite the first term in (4.2) as
We can estimate the mediants as \(\frac{1}{\sqrt{n}}\ll \theta _{h,k_0}', \theta _{h,k_0}'' \ll \frac{1}{\sqrt{n}}\) and setting \(\theta \mapsto \theta n^{-\frac{1}{2}}\), the above integral is asymptotic to
for some \(c>0\), say. We claim that we can apply Theorem 2.1 with \(x_0 \mapsto 0,\) \(A(x) \mapsto 1\) and B as above. Here, \(B(0)=0\) and expanding the geometric series gives
with \(\mathrm {Re}\left( \frac{4 \pi ^2}{\lambda _1+i\lambda _2} \right) > 0\). Finally, we claim that \(\mathrm {Re}(B(\theta )) \le 0\) with equality if and only if \(\theta =0.\) Indeed,
where \(\lambda _1+i\lambda _2=\left| \lambda _1+i\lambda _2 \right| e^{i\frac{\psi }{2}}\) and \(\psi \in \left( -\frac{\pi }{2}, \frac{\pi }{2}\right) .\) Lemma 2.7 applies to show
with equality if and only if
thus if and only if \(\theta =0,\) as claimed. Now by Theorem 2.1, we conclude that (4.3) is asymptotic to
and overall
When the \(e^{2\lambda _1\sqrt{n}}\) is brought back to the right-hand side, this is the right-hand side of Theorem 3.2.
For \(k\ne k_0\), we follow Parry in Lemma 5.2 of [18] and write
where \(\psi _k\) satisfies \(\mathrm {Li}_2(\zeta _b^{ak})=|\mathrm {Li}_2(\zeta _b^{ak})|e^{i\psi _k}.\) Arguing as for the major arcs, the expression \(\mathrm {Re}(\cdot )\) above is at most \(\cos ^2\left( \frac{\psi _k}{2}\right) \). Now let
Then
Thus,
We can choose \(\delta \) small enough so that the constant in the exponential is negative, and the minor arcs are exponentially smaller than the major arc(s). This completes the proof of cases (1), (2) and (3).
For case (4), we have \(\lambda _1+i\lambda _2=\lambda _1=\frac{\sqrt{\mathrm {Li}_2(1)}}{3}=\frac{\pi }{3\sqrt{6}}\). Exactly as in case (3) the minor arcs are those with \(k \ne 3\), and these are shown to be exponentially smaller than for \(k_0=3\). Thus, by Lemma 4.1 part (4), we have
where
Noting
we have
Setting \(\theta \mapsto \theta n^{-\frac{1}{2}}\) and arguing as before, both integrals are asymptotic to
Hence, the second term in (4.4) dominates and gives the claimed asymptotic formula. \(\square \)
5 Proof of Lemmas 4.1, 4.2 and 4.3
We prove Lemma 4.2 first then make use of these ideas in the proof of Lemma 4.1. We finish the section by proving Lemma 4.3.
5.1 Proof of Lemma 4.2
We rewrite \(E_{h,k}\) as a sum of two functions: a function to which we can apply Euler–Maclaurin summation, and another to which we apply the tools in Proposition 2.5 and Lemma 2.9.
Lemma 5.1
For \(\mathrm {Re}(t)>0\) and \(z=\zeta _b^a,\) we have
where
Proof
In \(E_{h,k}\), we expand the logarithm using its Taylor series as
This corresponds to the left term in \(g_{j,k}.\) For the middle term in \(g_{j,k}\), we compute (using \(\gcd (h,k)=1\))
Finally, it is simple to show that the logarithm of the product in (5.1) cancels with the sum of the right term in \(g_{j,k}\), simply by expanding the logarithm into its Taylor series. \(\square \)
We estimate the first term in (5.1) using Euler–Maclaurin summation. First, we need a technical definition. Since \(\text {gcd}(h,k) =1\), there is at most one \(j_0\) in the sum in (5.1) for which \(\zeta _{b}^{a}\zeta _{k}^{j_0h}=1;\) i.e., such that \(ak+bj_0h\equiv 0 \pmod {bk}.\) Define
Lemma 5.2
Let \(j_0\) be as above. For \(k \le n^{\varepsilon }\) and \(-\theta _{h,k}' \le \theta \le \theta _{h,k}''\), we have
Proof
Note that the function \(g_{j,k}(w)\) is holomorphic at 0 and in any cone \(|\mathrm {Arg}(w)| \le \frac{\pi }{2} - \eta .\) Also, \(\theta _{h,k}', \theta _{h,k}'' \le \frac{1}{kN}=O\left( \frac{1}{\sqrt{n}}\right) \) implies that \(t_{\theta }\) lies in such a fixed cone (see also [1] on p. 75). Thus, we can apply Theorem 2.3 to \(g_{j,d}(z)\) with \(w\mapsto t_{\theta }bk^2\), \(a\mapsto \frac{m}{bk},\) and \(N \mapsto 0\),
When summing the O-term, we get
where we used the fact that \(t_{\theta }\) lies in a cone. Summing first over m gives
Hence,
where the last step follows by Lemma 2.4. If \(\varepsilon <\frac{1}{4},\) then the terms \(O\left( \frac{k^3}{\sqrt{n}}\right) \) and \(O\left( \frac{k^5}{n}\right) \) are smaller than \(\sqrt{n}\) as needed since \(N = O(\delta \sqrt{n})\) where \(\delta \) is chosen small and independently of n. \(\square \)
It remains to estimate the product term in (5.2).
Lemma 5.3
Uniformly for \(k \le n^{\varepsilon }\) and \(-\theta _{h,k} \le \theta \le \theta _{h,k}''\), we have
Proof
Recall the sums \(G_m\) defined in Lemma 2.9. Using the Taylor expansion for the logarithm followed by Proposition 2.5, we write
It is elementary to show that at most one of \(\{ak+bjh\}_{1 \le j \le k}\) is divisible by bk. Suppose that this happens at \(j_0\) (if it never happens, then the argument is similar). Then \(G_m\left( \frac{ak+bhj_0}{bk}\right) =H_m\), the m-th harmonic number. Applying the formula \(\sum _{m \ge 1} H_mx^m=\frac{-\log (1-x)}{1-x}\), the above is
The fact that \(t_{\theta }\) lies in a cone \(|\mathrm {Arg}(t_{\theta })|\le \frac{\pi }{2}-\eta \) with \(j \le k \le n^{\varepsilon }<\sqrt{n}\) gives
Thus, using Lemma 2.10
as claimed. \(\square \)
Lemma 4.2 now follows from Lemmas 5.1, 5.2 and 5.3 by recalling that \(k\le n^{\varepsilon }\) where \(0 < \varepsilon \le \frac{1}{4}\):
5.2 Proof of Lemma 4.1
To prove Lemma 4.1, we need an elementary fact about the sets \(\mathcal {S}_{a,b}\).
Lemma 5.4
Let \(1 \le a < \frac{b}{2}\) with \(\gcd (a,b)=1\) and \(b \ge 3\). Then \((1,1)\not \in \mathcal {S}_{a,b}\), \((h,2)\not \in \mathcal {S}_{a,b}\), and \((h,3)\in \mathcal {S}_{a,b}\) if and only if \((a,b) =(1,3)\).
Proof
We prove the case \((h,k) = (h,2)\) and note that the remaining cases are analogous. We have that \( (h,2) \in S_{a,b}\) if and only if 2b divides \(2a+b\) or \(2a+2b\). Clearly, \(2b \not \mid (2a+2b)\), and since \(2a+b< 3b < 2 \cdot (2b)\),
which is a contradiction. \(\square \)
Proof of Lemma 4.1
Cases (1), (2) and (3) are simple consequences of Lemmas 5.1 and 5.2 and 5.4. For case (4), we suppose \(\zeta = \zeta _3\). Then one finds \(j_0(1,3,1,3)=2\) and Lemmas 5.1 and 5.2 imply
as claimed, whereas \(j_0(1,3,2,3)=1\), and so
as claimed. \(\square \)
5.3 Proof of Lemma 4.3
In preparation for the proof of Lemma 4.3, we rewrite \(E_{h,k}\) as in Lemma 5.1, this time using only the first two terms of \(g_{j,k}\). The proof is analogous.
Lemma 5.5
For \(\mathrm {Re}(t)>0\) and \(z=\zeta _b^{a},\) we have
where
We will need to estimate the sum in (5.2) separately for \(\ell \ge 1\) and \(\ell =0.\) For \(\ell \ge 1\), we can first compute the sum on j as
Thus, writing \(m=\nu k\) with \(1 \le \nu \le b\) when \(k \mid m\), we have
say, where
and
Lemma 5.6
For \(k \ge n^{\varepsilon }\), \(-\theta _{h,k}' \le \theta \le \theta _{h,k}''\) and \(t \mapsto t_{\theta }\), we have \(|S_1|=O\left( \log (n)\right) \).
Proof
We use Theorem 2.2 (with \(N \rightarrow \infty \)) to write
Here, \(f_1(z) \ll \frac{1}{z}\) as \(z \rightarrow 0,\) thus
Furthermore \(\int _{t\cdot \frac{c}{|t|}}^{t\infty } f_1(z)dz=O(1)\) for \(|\mathrm {Arg}(t)|\le \frac{\pi }{2}-\eta ,\) uniformly for any \(\eta , c>0.\) As noted before, \(t_{\theta }\) lies in such a cone, so
Similarly, one has
so \(\int _{t\cdot \frac{c}{|t|}}^{t\infty } f'_1(z)dz=O(1)\) for \(|\mathrm {Arg}(t)|\le \frac{\pi }{2}-\eta ,\) for any \(\eta , c>0.\) And one has \(f_1'(z) \ll \frac{1}{z^2}\) as \(z \rightarrow 0,\) thus
The above bounds are all clearly uniform in \(1 \le \nu \le b\), thus overall
as claimed. \(\square \)
Lemma 5.7
For \(k \ge n^{\varepsilon }\), \(-\theta _{h,k}' \le \theta \le \theta _{h,k}''\) and \(t \mapsto t_{\theta }\), we have \(|S_2|=O\left( n^{\frac{1}{2}-\varepsilon }\right) \).
Proof
For \(\mathrm {Re}(z)>0\), we see immediately that
Thus, since \(\tilde{f_2}\) is decreasing, we have
by integral comparison. We can bound the right term as
Furthermore, as \(\eta \rightarrow 0^+\), we have
Hence, overall,
as claimed. \(\square \)
It remains to estimate the double sum (5.2) for the term \(\ell =0;\) i.e.,
where
Note that \(\phi _a\) is holomorphic at 0 and in the cone \(|\mathrm {Arg}(w)| \le \frac{\pi }{2}- \eta ,\) for any \(\eta >0.\) We apply Lemma 5.8 to \(\phi _a\) to bound differences as follows.
Lemma 5.8
Let x be a complex number with positive imaginary part and \(|x| \le 1\). Then there is a constant \(c > 0\) independent from a and x, such that for all \(m \le \frac{1}{|x|}\) we have
Proof
The function \(\phi _a(z)\) is holomorphic in \(B_3(0)\). The functions \(\phi _a'(z)\) are uniformly bounded on \(\overline{B_{\frac{5}{2}}(0)} \subset B_3(0)\). Indeed, we have uniformly in a
On the other hand, by Lemma 2.6 applied to \(f = \phi _a\), \(U = B_3(0)\), and \(\overline{B_{\frac{5}{2}}(0)} \subset U\), we find, since \(|xm| \le 1\) and \(|x(m+1)| \le |mx| + |x| \le 2\)
where c does not depend on \(0 < a \le 1\). \(\square \)
We also require the following lemma for large values of m, whose proof is a straightforward calculation using that the denominators of the first term in \(\phi _a(w)\) are bounded away from 0.
Lemma 5.9
Let x be a complex number with positive imaginary part. Then all \(m > \frac{1}{|x|}\) we have
The following lemma, when combined with Lemmas 5.5–5.7, completes the proof of Lemma 4.3, and thus that of Theorem 3.2.
Lemma 5.10
For \( n^{\varepsilon } \le k \le N\) and \(-\theta _{h,k}' \le \theta \le \theta _{h,k}''\), we have
Proof
Let \(x := kt_{\theta }\) and \(a := \frac{j}{k}\). Note that we have \(0 < a \le 1\), \(\mathrm {Re}(x) > 0\), and \(\frac{|x|}{\mathrm {Re}(x)} \ll 1\) uniformly in k. We use Abel partial summation and split the sum into two parts:
In the case \(|x| > 1\), the first sum is empty, so we can assume \(|x| \le 1\). We first find with Proposition 2.5 that
It follows that with Lemma 5.8
where we used Lemma 2.10 and \(G_{bk}(1) = H_{bk} = O(\log (k))\) in the last step. Similarly, we find with Lemma 5.9 (without loss of generality we assume \(\frac{1}{|x|} < bk\))
Note that we uniformly have \(\phi _a(xbk) \ll 1\) (as \(1 \ll |xbk|\) and x is part of a fixed cone \(|\mathrm {Arg}(x)|\le \frac{\pi }{2}-\eta \)) as well as
and
as \(\frac{|x|}{\mathrm {Re}(x)} \ll 1, |x| \ll 1.\) Similarly,
As a result, using Lemma 2.10 (again up to at most one summand in \(O(\log (k))\)),
as claimed. \(\square \)
Notes
Note that the number of partitions \(\lambda \vdash n\) with largest part \(\ell (\lambda )\) equals the number of partitions with number of parts \(\ell (\lambda )\) (see also [1], Ch. 1), so the results of this paper can be reformulated taking number of parts into account instead.
Here and throughout we take the principal branch of the square-root and upcoming logarithms.
References
Andrews, G.: The Theory of Partitions. Cambridge University Press, Cambridge (1984)
Beckwith, O., Mertens, M.: On the number of parts in integer partitions lying in given residue classes. Ann. Comb. 21, 558 (2017)
Beckwith, O., Mertens, M.: The number of parts in certain residue classes of integer partitions. Res. Number Theory A11, 558 (2015)
Boyer, R., Goh, W.: Partition Polynomials: Asymptotics and Zeros. (2007). Preprint https://arxiv.org/abs/0711.1373
Boyer, R., Goh, W.: Polynomials associated with partitions: their asymptotics and zeroes. Contemp. Math. 471, 556 (2007)
Boyer, R., Keith, W.: Stabilization of coefficients for partitions polynomials. Integers A56, 778 (2013)
Boyer, R., Parry, D.: Zero attractors of partition polynomials (2021). preprint https://arxiv.org/abs/2111.12226
Bringmann, K., Craig, W., Males, J., Ono, K.: Distributions on partitions arising from Hilbert schemes and hook lengths (2021). Preprint https://arxiv.org/abs/2109.10394
Bringmann, K., Folsom, A., Ono, K., Rolen, L.: Harmonic Maass forms and mock modular forms. American Mathematical Society Colloquium Publications, New York (2017)
Bringmann, K., Jennings-Shaffer, C., Mahlburg, K.: On a Tauberian theorem of Ingham and Euler–Maclaurin summation. Ramanujan J (2021)
Cakmak, D., Tiryaki, A.: Mean value theorem for holomorphic functions. Electron. J. Equ. 5, 7796 (2012)
Craig, W.: On the number of parts in congruence classes for partitions into distinct parts (2021). preprint https://arxiv.org/abs/2110.15835
Hardy, G.H., Ramanujan, S.: Asymptotic formulae in combinatory analysis. Proc. London Math. Soc. 17, 75–115 (1918)
Hardy, G.H., Wright, E.M.: Introduction to the Theory of Numbers, 4th edn. Oxford University Press, Oxford (1960)
Ingham, A.E.: A Tauberian theorem for partitions. Ann. Math. 2, 66368 (1941)
Iwaniec, H., Kowalski, E.: Analytic Number Theory. Oxford University Press, Oxford (2004)
Males, J.: Asymptotic equidistribution and convexity for partition ranks. Ramanujan J. 54, 397–413 (2021)
Parry, D.: A polynomial variation on Meinardus’ theorem. Int. J. Number Theory 11, 251–268 (2015)
Pinsky, M.: Introduction to Fourier Analysis and Wavelets. Graduate Studies in Mathematics, New York (2009)
Radamacher, H.: On the partition function \(p(n)\). Proc. London Math. Soc. 43, 241–254 (1937)
Stein, E., Shakarchi, R.: Fourier Analysis: An Introduction. Princeton University Press, Princeton (2003)
Temme, N.: Asymptotic Methods for Integrals. Series in Analysis, vol. 6. World Scientific, London (2015)
Tenenbaum, G.: Introduction to Analytic and Probabilistic Number Theory, vol. 163, 3rd edn. Graduate Studies in Mathematics, New York (2015)
Wright, E.M.: Asymptotic partition formulae III. Partitions into \(k\)-th powers. Acta Math. 63, 143–191 (1934)
Acknowledgements
We would like to thank Kathrin Bringmann, Joshua Males, Caner Nazaroglu, Ken Ono and Wadim Zudilin for useful discussions and for making comments on an earlier version of this paper. We are grateful to the referees for their detailed comments that improved the exposition.
Funding
Open Access funding enabled and organized by Projekt DEAL.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
There is no conflict of interest for the current study.
Additional information
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
Bridges, W., Franke, J. & Garnowski, T. Asymptotics for the twisted eta-product and applications to sign changes in partitions. Res Math Sci 9, 61 (2022). https://doi.org/10.1007/s40687-022-00355-x
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s40687-022-00355-x