Asymptotics for the twisted eta-product and applications to sign changes in partitions
Abstract.
We prove asymptotic formulas for the complex coefficients of , where is a root of unity, and apply our results to determine secondary terms in the asymptotics for , the number of integer partitions of with number of parts congruent modulo . Our results imply that, as , the difference for oscillates like a cosine when renormalized by elementary functions. Moreover, we give asymptotic formulas for arbitrary linear combinations of
Key words and phrases:
circle method, partitions, asymptotics, sign-changes, secondary terms2020 Mathematics Subject Classification:
11P82, 11P831. Introduction and statement of results
Let be a positive integer. A partition of is a weakly decreasing sequence of positive integers that sum to . The number of partitions of is denoted by . For example, one has , since the relevant partitions are
When , the are called the parts of the partition , and we write to denote that is a partition of . The partition function has no elementary closed formula, nor does it satisfy any finite order recurrence. However, when defining , its generating function has the following product expansion
| (1.1) |
where as usual and denotes the Dedekind eta function. In [13], Hardy and Ramanujan used (1.1) to show the asymptotic formula
| (1.2) |
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 up to small errors. A later refinement by Rademacher [20], exploiting the modularity of , provides a convergent series for .
In this work we study the distribution of ordinary partitions whose number of parts are congruent to some residue class modulo .111A similar sounding, but entirely different problem is to study the total number of parts that are all congruent to modulo . This problem was studied in detail by Beckwith–Mertens [3, 2] for ordinary partitions and recently by Craig [12] for distinct parts partitions. The number of such partitions is denoted by .222Note that the number of partitions with largest part equals the number of partitions with number of parts (see also [1], Ch. 1), so the results of this paper can be reformulated taking number of parts into account instead. It is well-known that the numbers are asymptotically equidistributed; i.e.,
| (1.3) |
The proof of (1.3) begins by writing the generating function for in terms of non-modular eta-products twisted with roots of unity modulo which is a direct consequence of the orthogonality of roots of unity:
| (1.4) |
where denotes the usual -Pochhammer symbol and . Since the first term does not depend on 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 (the number of partitions with rank congruent to modulo ) is asymptotically equidistributed. Males’ proof uses Ingham’s Tauberian theorem [15] and exploits the modularity of the generating function of , 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, , 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.
Example 1.1.
Consider the case , and . The -series of the differences has the following oscillating shape
|
|
|||
|
|
Our first result predicts this oscillation as follows. As usual, we define the dilogarithm for by the generating series
Throughout we use the principle branch of the complex square root and logarithm.
Theorem 1.2.
Let be an integer. Then for any two residue classes , we have
as , where333Here and throughout we take the principal branch of the square-root and upcoming logarithms. and and are implicitly defined by
A more general version of Theorem 1.2 holds for values , see Theorem 3.20, where the special cases have to be treated slightly differently. Figure 2 shows that this prediction is surprisingly accurate even for small .
The proof makes use of (1.4) and a detailed study of the coefficients when is a root of unity. Prompted by a question of Stanley, a study of the polynomials 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 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 -hook lengths. Asymptotics for were studied by Wright [24] when is any positive real number, and then by Boyer and Goh [4, 5] for . Our results essentially complete this study, proving asymptotics when 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 . For example, we have to overcome the fact that when is a root of unity, the series representation of the polylogarithm does not converge for .
Asymptotics in the case that are as follows, and a general version with the sporadic cases is stated in Theorem 3.17.
Theorem 1.3.
Let . Then we have
Remark 1.4.
Our techniques for bounding minor arcs seem not to readily apply when and is not a root of unity, so we leave it as an open problem to prove asymptotic formulas for in this case. Boyer and Goh [4] prove that the unit circle is part of the zero attractor of the polynomials , and it follows from their results that asymptotic formulas for cannot be uniform on any subset of which is an open neighborhood of an arc of the unit circle.
The above results can be further developed to linear combinations of (where is fixed). Each relevant combination corresponds to a polynomial
via . Perhaps the most combinatorially interesting cases are ; i.e., differences of partition numbers. This means that for any two nonempty disjoint subsets of integers, we consider the differences
The asymptotic behavior of these differences is described in Theorem 3.22. When choosing the coefficients 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.17). In contrast, one can deduce formula (1.3) by only elementary means without a thorough analysis of the coefficients .
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 to changes the “phase” but not the “amplitude” of the asymptotic terms. The following example demonstrates this fact.
Example 1.5.
Let . For the sets and , we find
, where is the 12th cyclotomic polynomial. The corresponding difference of partition numbers is
By shifting the sets with integers , we find that, more generally, all differences
have the same growth in their amplitudes but have different phases of sign changes. Since has zeros , the dominating term in the asymptotic expansion is induced by the root of unity . In fact, we obtain
| (1.5) |
with , where and are defined by
Note that , , and all do not depend on the choice of . One can then asymptotically describe the regions of , where
In contrast to Example 1.5, when is prime, one cannot decrease the order of growth below simple differences using any rational combination of the . 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 for values . In Section 3, we state our main result, Theorem 3.17, and applications. We prove Theorem 3.17 in Sections 4 and 5 using the circle method. Section 5 deals with the primary difficulty of bounding the minor arcs.
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.
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.6 (Laplace’s method, see Section 1.1.5 of [19]).
Let be continuous functions. Suppose such that and that
with Then as
We are ultimately interested in how the coefficients of a series grow as . The classical Euler–Maclaurin summation formulas can be applied in many cases to link the growth of to the growth of as approaches the unit circle. We state the Euler–Maclaurin summation formulas in two different forms.
Theorem 2.7 (classical Euler–Maclaurin summation, see p. 66 of [16]).
Let denote the fractional part of . For and 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.8 is uniform in
Theorem 2.8 (uniform complex Euler–Maclaurin summation, [10], Theorem 1.2).
Suppose and suppose that is holomorphic in a domain containing with derivatives of sufficient decay; i.e., there is an such that for all as . Then uniformly for , we have
uniformly as in .
To identify a constant term in our asymptotic formula, we cite the following integral calculation of Bringmann, Craig, Males and Ono.
Lemma 2.9 ([8], Lemma 2.3).
For
Finally, we will use Abel partial summation extensively when bounding the twisted eta-products on the minor arcs.
Proposition 2.10 (Abel partial summation, see p. 3 of [23]).
Let and . For sequences , of complex numbers, if 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.11.
Let be a holomorphic function and a compact disk. Then, for all with , we have
We also need the following elementary maximum; for a proof see [18], Lemma 5.2.
Lemma 2.12.
For and , we have
with equality if and only if satisfies
2.3. Bounds for trigonometric series and the polylogarithm
We recall that for complex numbers and with the polylogarithm is defined by the series
We are especially interested in the case , where 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.13 (Proposition 4, [7]).
The function is decreasing on the interval
We also need to consider the derivative of the function and its partial sums. Let
Then the following bound holds.
Lemma 2.14.
We have, uniformly for ,
Proof.
Note that we have
and as it is well known that is uniformly bounded in (see [21] on p. 94) we are left with the cosine sum. Let and . Consider the meromorphic function
together with the rectangle with vertices , , and . Notice that in a punctured disk of radius centered at , 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 it suffices to consider values . A straightforward calculation shows that the bottom side integrals are bounded uniformly in . Similarly, also using that is uniformly bounded on lines for the second part, one argues
A similar argument yields
For the rectangle top, note with the use of the substitution we have
| (2.1) |
With the Residue Theorem we obtain
and the bound as (since ) 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 for all . This completes the proof. ∎
Lemma 2.14 has the following important consequence.
Lemma 2.15.
Let , , and be positive integers, such that . We assume that and are fixed. Then we have
as , uniformly in .
Proof.
The assumption implies that the map is a bijection modulo . One can show by elementary means that there is at most one such that divides . First, we assume that such a exists. Using , we first reorder the sum, then apply Lemma 2.14 to obtain
by Stirling’s formula. Now, assume that there is no such . In this case we find , such that
Using again Lemma 2.14 and Stirling’s formula, we obtain
Since clearly
the lemma follows. ∎
3. Main results and applications
3.1. Twisted eta-products
In this section, we record the general asymptotic formula for where is any root of unity. Note that , so it suffices to find asymptotic formulas for 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 is a solution to . Here,
Since the values and arise as solutions to a non-algebraic equation, it is very unlikely that they are rational multiples of . Therefore, we will no longer consider them in future investigations.
Theorem 3.16 ([4], discussion prior to Theorem 2).
For , we have
Theorem 3.17.
(1) If then
(2) If then
(3) If then
(4) We have
We prove Theorem 3.17 in Sections 4 and 5.
Remark 3.18.
Recall that we have the asymptotic formula (1.2) for , whereas for , standard combinatorial methods give
where counts the number of partitions of into distinct odd parts. An asymptotic formula for can be worked out using standard techniques. For example, Ingham’s Tauberian theorem (see [10], Theorem 1.1) with the modularity of the Dedekind -function yields
Note the lack of uniformity in the asymptotic formulas for near ; in particular, the asymptotic formulas for and cannot be obtained by taking in cases (1) and (2).
3.2. Applications to differences of partition functions
In this section, we apply Theorem 3.17 to differences of the partition functions , partitions of with number of parts congruent to modulo . The following elementary proposition relates the the numbers to the coefficients .
Proposition 3.19.
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. ∎
Thus, asymptotics for differences of can be identified using the asymptotic formulas found for in Theorem 3.17, in particular the equidistribution of the largest part in congruence classes follows immediately: Furthermore, using the Hardy–Ramanujan–Rademacher exact formula for ([1], Theorem 5.1) with Theorem 3.17, one can improve this in the various cases. For example, for we have
where and are defined by
We record a number of results below in the same vein. Considering simple differences, it follows from Proposition 3.19 that when rewriting each in terms of the two summands cancel. With a few exceptions for , the dominant terms are always and .
Theorem 3.20.
Let
(1) For we have
(2) For , we have
where and are defined by
(3) For and of opposite parity, we have
(4) For , or for and of the same parity, we have
where , and are defined by
Proof.
When , Theorem 3.20 follows from Proposition 3.19. Let By Proposition 3.19, it follows that
Upon dividing both sides by , Lemma 2.13 implies that the sum on the right is , for some and it then follows from Theorem 3.17 that
| (3.1) |
which gives the claim of Theorem 3.20.
The other cases are proved similarly by noting that Lemma 2.13 and Theorem 3.17 imply that the and terms always dominate for except in the case that , where dominates when have opposite parity. But vanishes from the sum in Proposition 3.19 when and have the same parity, which leads to the third case in Theorem 3.20. ∎
More generally, if with , then Theorem 3.17 implies asymptotic formulas for any weighted count To state our general theorem, we let
Let be the roots of , and let
for , whenever
Theorem 3.21.
With notation as above, we have the following asymptotic formulas.
(1) If then
(2) If then
where and are defined by
(3) If and then
where and are defined by
(4) If , then
where and are defined by
(5) If , then
(6) If then
Proof.
Theorem 3.21 is proved similarly to Theorem 3.20. For Cases (1) and (6), the asymptotic formula for and Proposition 3.19 directly implies
for Cases (1) and (6) respectively.
One application of the above theorem generalizes Theorem 3.20 to differences of partitions with number of parts modulo in one of two disjoint sets of residue classes . That is, we consider
and prove a more explicit version of Theorem 3.21 in this case. Since is a polynomial of degree at most with integer coefficients, there must exist some such that otherwise would be divisible by where is the -th cyclotomic polynomial, a contradiction.
Theorem 3.22.
Let and let be disjoint subsets of integers. If then
Otherwise, if , then we have the following cases. Let be the largest integer such that and
(1) If or if and , then
where , and are defined by
(2) If or with even, and , we have the following allowable sets:
-
•
If and ,
-
•
If , is even and
The asymptotic formulas are then given by
where
(3) If , is even and , or and is odd, we have the following sets and :
-
•
If is odd, and must contain distinct residue classes modulo .
-
•
If is even,
where
The asymptotic formula is then given by
(4) If then for some of opposite parity we have
and
Proof sketch of Theorem 3.22.
The asymptotic analysis is similar to the proof of Theorem 3.20, since Lemma 2.13 and Theorem 3.17 imply that the sequence , ranked from in asymptotic order from least to greatest, is
Thus, for example in case (3), the asymptotic behavior of is determined by and since all other vanish in . Furthermore, in this case we must have
and . Since
this leads directly to the possible sets and described in case 3. Finally, note that, given and defined in terms of and modulo , we have
This is taken into account in the definition of the constant The other cases are proved similarly. ∎
We make a few remarks.
Remark 3.23.
(1) Theorem 3.22 case (1), in combination with Lemma 2.13, shows that one can reduce the growth of the amplitudes in the differences exponentially, as long as the corresponding polynomial vanishes at the crucial roots of unity. But the options for such types of cancellation strongly depend on . For example, if is a prime number, there is not even a rational combination (except for the trivial combination) such that the amplitudes of grow exponentially less than any simple difference . The simple algebraic reason behind this is that the minimal polynomial of has degree 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 and by some integer , and then take least residues modulo to compute , then this polynomial has the same roots of unity as , and so
always has the same asymptotic behavior in Theorem 3.22 as At the same time, the phase in the cosine changes. Indeed, we obtain
| (3.2) |
where all the constants are the same as in Theorem 3.22 (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 in (3.2), one finds using , as ,
(3) Cases 3 and 4 in Theorem 3.22 show that for , there are finitely many sets and such that the asymptotic behavior of is determined by , and that the number of such sets is independent of . In fact this is true for any , and we leave it as an open problem to describe the sets in general. The sets and need not each consist of one congruence class each modulo for example with , the polynomial has
3.3. Examples
In this section, we provide some examples.
Example 3.24.
Let , and consider the difference . Then according to Theorem 3.20, we obtain
| (3.3) |
where , and and are given implicitely by
Note that this implies (choosing to be the absolute value of the right hand side of the equation above)
| (3.4) | ||||
Considering the first 900 coefficients numerically yields
which are the highest indices until a change of signs in the sequence . 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 and case eleven with give slightly wrong predictions.
The next example refers to higher differences of partition functions.
Example 3.25.
Again, we consider the case . In the spirit of Theorem 3.22 we want to consider multi-termed differences. To do so, we need two subsets , such that the corresponding nontrivial polynomial of degree at most 5 vanishes at as many roots of unity around 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 . We continue by trying to eliminate also the 3rd roots of unity; i.e., with
This is exactly the case (4) of Theorem 3.22. As a result, setting and , we find, as ,
Also note that is much smaller then the exponent in (3.3), compare also (3.4).
Finally, we give an application of Remark 3.23.
Example 3.26.
In light of Equation (3.2), we can choose such that the cosine becomes a sine on the right hand side. Using Pythagoras’ Theorem, and considering the case and , we obtain an asymptotic formula without oscillating terms. Indeed, according to Theorem 3.20 (4) and Remark 3.23, respectively, we obtain for residue classes that
There is no difficulty to extend this type of asymptotic formula for higher differences in the spirit of Theorem 3.22 (1).
4. Proof of Theorem 3.17
Since the asymptotic formulas for and are well-known, we assume throughout that with and since .
The setup follows the standard Hardy–Ramanujan circle method, expressing as a contour integral about 0 and breaking the contour apart with the sequence of Farey fractions of order 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.28 and 4.29 which we prove in the next section.
Let , for some to be chosen independently of and small enough during the course of the proof. Let be the sequence of Farey fractions of order with mediants and at . We write
| (4.1) |
with 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 dominate, that is they are the major arcs, and all the other integrals are exponentially smaller, that is they are minor arcs. The will be shown to be error terms on all arcs; the following gives the growth of the up to on each of the possible major arcs.
Lemma 4.27.
(1) For and , we have
(2) For and , we have
(3) For and , we have
and for , we have
(4) For and , we have
and for , we have
The next two lemmas give uniform bounds on to be applied on the minor arcs. The proofs are quite intricate and are provided in the next section. We assume throughout that .
Lemma 4.28.
Uniformly for and , we have
The next lemma treats the case of large denominators.
Lemma 4.29.
Uniformly for and , we have
We postpone the proofs of Lemmas 4.27–4.29 until Section 5. With these key lemmas in hand, the proof of Theorem 3.17 follows [18] closely.
Proof of Theorem 3.17.
Cases (1), (2) and (3). Assume We write
It follows from the choice , Lemmas 4.28 and 4.29 that uniformly. Using this and Lemma 4.27, we have
| (4.2) |
Recalling (4.1), we rewrite the first term in (4.2) as
We can estimate the mediants as and setting , the above integral is asymptotic to
| (4.3) |
for some , say. We claim that we can apply Theorem 2.6 with and as above. Here, and expanding the geometric series gives
with . Finally, we claim that with equality if and only if Indeed,
where and Lemma 2.12 applies to show
with equality if and only if
thus if and only if as claimed. Now by Theorem 2.6, we conclude that (4.3) is asymptotic to
and overall
When the is brought back to the right-hand side, this is the right-hand side of Theorem 3.17.
For , we follow Parry in Lemma 5.2 of [18] and write
where satisfies Arguing as for the major arcs, the expression above is at most . Now let
Then
Thus,
We can choose 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 . Exactly as in case (3) the minor arcs are those with , and these are shown to be exponentially smaller than for . Thus, by Lemma 4.27 part (4), we have
where
Noting
we have
| (4.4) | ||||
Setting and arguing as before, both integrals are asymptotic to
Hence, the second term in (LABEL:e13majorarcsint2b) dominates, and gives the claimed asymptotic formula. ∎
5. Proof of Lemmas 4.27, 4.28, and 4.29
We prove Lemma 4.28 first then make use of these ideas in the proof of Lemma 4.27. We finish the section by proving Lemma 4.29.
5.1. Proof of Lemma 4.28
We rewrite 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.10 and Lemma 2.14.
Lemma 5.30.
For and we have
| (5.1) |
where
Proof.
In , we expand the logarithm using its Taylor series as
This corresponds to the left term in For the middle term in , we compute (using )
Finally, it is simple to show that the logarithm of the product in (5.1) cancels with the sum of the right term in , simply by expanding the logarithm into its Taylor series. ∎
We estimate the first term in (5.1) using Euler–Maclaurin summation. First we need a technical definition. Since , there is at most one in the sum in (5.1) for which i.e., such that Define
Lemma 5.31.
Let be as above. For and , we have
Proof.
Note that the function is holomorphic at 0 and in any cone Also, implies that lies in such a fixed cone (see also [1] on p. 75). Thus, we can apply Theorem 2.8 to with , and ,
When summing the -term, we get
where we used the fact that lies in a cone. Summing first over gives
Hence,
where the last step follows by by Lemma 2.9. If then the terms and are smaller than as needed since where is chosen small and independently of . ∎
It remains to estimate the product term in (5.2).
Lemma 5.32.
Uniformly for and , we have
Proof.
Recall the sums defined in Lemma 2.14. Using the Taylor expansion for the logarithm followed by Proposition 2.10, we write
It is elementary to show that at most one of is divisible by . Suppose that this happens at (if it never happens, then the argument is similar). Then , the -th harmonic number. Applying the formula , the above is
5.2. Proof of Lemma 4.27
To prove Lemma 4.27, we need an elementary fact about the sets .
Lemma 5.33.
Let with and . Then , , and if and only if .
Proof.
We prove the case and note that the remaining cases are analogous. We have that if and only if divides or . Clearly, , and since ,
which is a contradiction. ∎
5.3. Proof of Lemma 4.29
In preparation for the proof of Lemma 4.29, we rewrite as in Lemma 5.30, this time using only the first two terms of . The proof is analogous.
Lemma 5.34.
For and we have
| (5.2) |
where
We will need to estimate the sum in (5.2) separately for and For , we can first compute the sum on as
Thus, writing with when , we have
say, where
and
Lemma 5.35.
For , and , we have .
Proof.
We use Theorem 2.7 (with ) to write
Here, as thus
Furthermore for uniformly for any As noted before, lies in such a cone, so
Similarly, one has
so for for any And one has as thus
The above bounds are all clearly uniform in , thus overall
as claimed. ∎
Lemma 5.36.
For , and , we have .
Proof.
For , we see immediately that
Thus, since is decreasing, we have
by integral comparison. We can bound the right term as
Furthermore, as , we have
Hence, overall,
as claimed. ∎
It remains to estimate the double sum (5.2) for the term i.e.,
where
Note that is holomorphic at 0 and in the cone for any We apply Lemma 5.37 to to bound differences as follows.
Lemma 5.37.
Let be a complex number with positive imaginary part and . Then there is a constant independent from and , such that for all we have
Proof.
The function is holomorphic in . The functions are uniformly bounded on . Indeed, we have uniformly in
On the other hand, by Lemma 2.11 applied to , , and , we find, since and
where does not depend on . ∎
We also require the following lemma for large values of , whose proof is a straightforward calculation using that the denominators of the first term in are bounded away from 0.
Lemma 5.38.
Let be a complex number with positive imaginary part. Then all we have
The following lemma, when combined with Lemmas 5.34–5.36, completes the proof of Lemma 4.29, and thus that of Theorem 3.17.
Lemma 5.39.
For and , we have
Proof.
Let and . Note that we have , , and uniformly in . We use Abel partial summation and split the sum into two parts:
In the case , the first sum is empty, so we can assume . We first find with Proposition 2.10 that
It follows that with Lemma 5.37
where we used Lemma 2.15 and in the last step. Similarly, we find with Lemma 5.38 (without loss of generality we assume )
Note that we uniformly have (as and is part of a fixed cone
) as well as
and
as Similarly,
Data Availability Statement
Data sharing not applicable to this article as no data sets were generated or analysed during the current study.
Conflict of Interest Statement
There are no conflicts of interest for the current study.
References
- [1] G. Andrews. The Theory of Partitions. Cambridge University Press, 1984.
- [2] O. Beckwith and M. Mertens. “On the number of parts in integer partitions lying in given residue classes”. Annals of Combinatorics 21 (2017).
- [3] O. Beckwith and M. Mertens. “The number of parts in certain residue classes of integer partitions”. Res. Number Theory A11 (2015).
- [4] R. Boyer and W. Goh. “Partition Polynomials: Asymptotics and Zeros”. Preprint (2007). https://arxiv.org/abs/0711.1373
- [5] R. Boyer and W. Goh. “Polynomials associated with partitions: their asymptotics and zeroes”. Contemp. Math. 471 (2007).
- [6] R. Boyer and W. Keith. “Stabilization of coefficients for partitions polynomials”. Integers A56 (2013).
- [7] R. Boyer and D. Parry. “Zero attractors of partition polynomials”. preprint (2021). https://arxiv.org/abs/2111.12226
- [8] K. Bringmann, W. Craig, J. Males, and K. Ono. “Distributions on partitions arising from Hilbert schemes and hook lengths”. Preprint (2021). https://arxiv.org/abs/2109.10394
- [9] K. Bringmann, A. Folsom, K. Ono, and L. Rolen. Harmonic Maass forms and mock modular forms. American Mathematical Society Colloquium Publications. AMS, 2017.
- [10] K. Bringmann, C. Jennings-Shaffer, and K. Mahlburg. “On a Tauberian theorem of Ingham and Euler–Maclaurin summation”. Ramanujan J. (2021)
- [11] D. Cakmak and A. Tiryaki. “Mean value theorem for holomorphic functions”. Electron. J. Equ. (2012).
- [12] W. Craig. “On the number of parts in congruence classes for partitions into distinct parts”. preprint (2021) https://arxiv.org/abs/2110.15835
- [13] G. H. Hardy and S. Ramanujan. “Asymptotic formulae in combinatory analysis.” Proc. London Math. Soc. 17 (1918), pp. 75–115.
- [14] G. H. Hardy and E. M. Wright. Introduction to the Theory of Numbers, fourth edition. Oxford University Press, 1960.
- [15] A. E. Ingham. “A Tauberian theorem for partitions”. Annals of Mathematics (1941).
- [16] H. Iwaniec and E. Kowalski. Analytic Number Theory. Oxford University Press, 2004.
- [17] J. Males. “Asymptotic equidistribution and convexity for partition ranks”. Ramanujan J. 54 (2021), pp. 397–413.
- [18] D. Parry. “A polynomial variation on Meinardus’ theorem”. Int. J. of Number Theory 11 (2015), pp. 251–-268.
- [19] M. Pinsky. Introduction to Fourier Analysis and Wavelets. Graduate Studies in Mathematics. AMS, 2009.
- [20] H. Radamacher. “On the partition function ”. Proc. London Math. Soc. 43 (1937), pp. 241–254.
- [21] E. Stein and R. Shakarchi. Fourier Analysis: An Introduction. Princeton University Press, 2003.
- [22] N. Temme. Asymptotic Methods for Integrals. Vol. 6 Series in Analysis. World Scientific, 2015.
- [23] G. Tenenbaum. Introduction to Analytic and Probabilistic Number Theory, third edition. Vol. 163. Graduate Studies in Mathematics. AMS, 2015.
- [24] E. M. Wright. “Asymptotic partition formulae III. Partitions into -th powers”. Acta Math. 63 (1934), pp. 143–191.