
TL;DR
This paper provides detailed descriptions and asymptotic analysis of Sylvester's waves, which decompose the restricted partition function, revealing when initial waves approximate the function well as both parameters grow large.
Contribution
It offers the first asymptotic descriptions of the initial Sylvester waves for large N and n, enhancing understanding of partition function approximations.
Findings
Asymptotic formulas for initial waves as N and n grow large
Conditions under which initial waves approximate the partition function well
Application of saddle-point method and dilogarithm in proofs
Abstract
The restricted partition function counts the partitions of the integer into at most parts. In the nineteenth century Sylvester described these partitions as a sum of waves. We give detailed descriptions of these waves and, for the first time, show the asymptotics of the initial waves as and both go to infinity at about the same rate. This allows us to see when the initial waves are a good approximation to in this situation. Our proofs employ the saddle-point method of Perron and the dilogarithm.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Advanced Mathematical Identities · Mathematical functions and polynomials
Partitions and Sylvester waves
Cormac O’Sullivan111
2010 Mathematics Subject Classification. 11P82, 41A60
Key words and phrases. Restricted partitions, Sylvester waves, asymptotics, saddle-point method.
This research was supported, in part, by a grant of computer time from the City University of New York High Performance Computing Center under NSF Grants CNS-0855217, CNS-0958379 and ACI-1126113. Support for this project was also provided by a PSC-CUNY Award, jointly funded by The Professional Staff Congress and The City University of New York.
(July 15, 2017)
Abstract
The restricted partition function counts the partitions of the integer into at most parts. In the nineteenth century Sylvester described these partitions as a sum of waves. We give detailed descriptions of these waves and, for the first time, show the asymptotics of the initial waves as and both go to infinity at about the same rate. This allows us to see when the initial waves are a good approximation to in this situation. Our proofs employ the saddle-point method of Perron and the dilogarithm.
1 Introduction
1.1 Decomposing partitions into waves
Let be the number of partitions of the integer . This is the number of ways to write as a sum of non-increasing positive integers. Also let count the partitions of with at most summands. (We are following the notation that was convenient in [Rad73, O’S15, O’S16a].) As usual, and are defined to be . Since the work of Cayley [Cay56] and Sylvester [Syl82], we know that
[TABLE]
where each may be expressed in terms of a sequence of polynomials for . Similarly to [SZ12, p. 641] we write
[TABLE]
where the notation in (1.2) indicates that the value of is given by one of the polynomials on the right and we select when . As we will see, the degrees of the polynomials on the right of (1.2) are at most .
For example, with we have where
[TABLE]
This computation was first carried out by Cayley in 1856, [Cay56, p. 132]. Sylvester called the -th wave and provided the formula
[TABLE]
in [Syl82]. Here indicates the coefficient of in the Laurent expansion about [math], and the sum is over all primitive -th roots of unity . For example, Glaisher shows in [Gla09, Sections 19-30] that the first wave is
[TABLE]
where the Bernoulli numbers are the constant terms of the Bernoulli polynomials , defined with
[TABLE]
We will take (1.4) as our definition of and prove in Section 2 that (1.1) and (1.2) follow.
Clearly the first wave will make the largest contribution to for large . Similarly, for any fixed as we have , since the first wave has the biggest degree, and the well-known asymptotic222As usual, the notation , or equivalently , means that there exists a so that for all in a specified range. The number is called the implied constant.
[TABLE]
then follows from (1.5).
1.2 Main results
A more difficult question is how or the first waves compare with as and both go to together. Suppose, to begin with, that . We obtain the unrestricted partitions , and see for example that
[TABLE]
So gives a good approximation to for and we may ask if for large .
To examine this question we recall the formula of Hardy, Ramanujan and Rademacher, given for example in [Rad73, Eq. (120.10)] as
[TABLE]
where may be expressed with Selberg’s formula [Rad73, Eq. (123.2)] as
[TABLE]
The term of (1.8) is already a good approximation to ; using Rademacher’s bound in [Rad73, p. 277] for the error after truncation yields, since ,
[TABLE]
The only comparison between and we have found in the literature is by Szekeres. He compared the expansion of as a sum of Sylvester waves to the expansion (1.8), noting in [Sze51, p. 108] that the corresponding terms seem to match up for small values of . For example, when the first three terms of (1.8) give
[TABLE]
He speculated that the correspondence between (1.7) and (1.10) would improve as gets larger.
In fact we show that the sum of the first waves does not stay close to for large . The size of these waves is approximately whereas grows like according to (1.9). More precisely, for the first 100 waves , we prove the following.
Theorem 1.1**.**
There exist explicit constants and in so that as
[TABLE]
The numbers and are coming from the saddle-point method, with the unique solution in to
[TABLE]
where denotes the dilogarithm function, as described in Section 4.2, and so that
[TABLE]
In [O’S16c] it is shown that and may be found to any precision and we have
[TABLE]
Hence we may equivalently present (1.11) as
[TABLE]
with
[TABLE]
For large we see that the first waves trace an oscillating sine wave with amplitude growing exponentially. The period of the oscillation is and successive waves increase by a factor of approximately . The number , which is controlling this behaviour, is in fact a zero of the dilogarithm on a non-principal branch and was first identified in [O’S15]. The Rademacher coefficients studied in [O’S15] have very similar asymptotic properties to Sylvester waves, and indeed they may be expressed in terms of each other - see [O’S15, Sect. 4].
Theorem 1.1 is not the best possible result; we expect it to be true with the sum of the first waves replaced by just the first wave. Numerically, the other waves are much smaller than the first, as shown in Table 1 for example.
Comparing (1.14) and (1.9), we see that the first waves must eventually become much larger than . In fact equals the right side of (1.9) for . We see in Table 2 that and get further and further apart after this value. On the other hand, for the first waves are a good approximation to as we see in Section 8.2.
Our main result is the following, of which Theorem 1.1 is a special case. Instead of restricting to we allow in a range between and .
Theorem 1.2**.**
Let be a positive real number. Suppose and for satisfying . Then there are explicit coefficients so that
[TABLE]
as where and the implied constant depends only on and .
The formula for the next coefficient, , is given in Proposition 5.2. These first waves show the same basic oscillating behavior as the case, with period and increasing by a factor of approximately with each :
[TABLE]
where, consistent with (1.16),
[TABLE]
As before, we expect Theorem 1.2 to be true with the left side of (1.17) replaced by just the first wave . Instances of Theorem 1.2, comparing the right side of (1.17) to the first wave, are displayed in Table 3.
Taking and in Theorem 1.2 easily gives the following corollary.
Corollary 1.3**.**
Fix . Then
[TABLE]
as for an implied constant depending only on .
Thus we see that even in the wave expansion of , corresponding to in (1.20), the first waves are becoming exponentially large with . So in general we expect some of the individual waves on the right of (1.1) to be much larger than , indicating a lot of cancelation on the right side.
A situation where the first waves are the same size as is given next.
Theorem 1.4**.**
Let be in the range . Then for positive integers and we have
[TABLE]
as where the implied constant is absolute.
Theorem 1.4 is easily shown using the methods from the proof of Theorem 1.2. However, a stronger result that replaces the waves by the first wave and increases the range of should be possible. Indeed the work in [Sze51] suggests that the correct range for should be much larger.
2 Sylvester waves
2.1 Basic properties
As in [O’S16a, Sect. 2.1] we define
[TABLE]
and it is easy to show that for any
[TABLE]
Our goal is to express the Sylvester waves as residues of . As a function of , is meromorphic with all poles contained in . More precisely, the set of poles of in equals , the Farey fractions of order in . We write
[TABLE]
for . When dealing with residues the next simple relations for are useful:
[TABLE]
With (2.2), (2.3) and (2.6) we obtain
[TABLE]
A simple exercise with (2.6) also shows, for , and , that
[TABLE]
From (2.7), (2.8) and (2.9) we find:
Proposition 2.1**.**
For all and all ,
[TABLE]
As shown in [O’S16a, Thm. 2.1], we may relate the right side of (2.10) above to the restricted partitions. Briefly, the generating function
[TABLE]
with replaced by becomes . We therefore have
[TABLE]
for any with large enough. Integrating around the rectangle with corners , , and , using (2.2), (2.4) and Cauchy’s residue theorem proves:
Theorem 2.2**.**
For and we have
[TABLE]
With Proposition 2.1 and Theorem 2.2 we have shown that , (i.e. equality (1.1)), follows from the wave definition (1.4). This result is known as Sylvester’s Theorem - see for example [O’S15, Sect.4] and its contained references. The next result, showing that (1.2) is also a consequence of (1.4), follows for example from [Gla09, Sections 4-7] which uses partial fractions. We give a new proof.
Proposition 2.3**.**
For each wave , equation (1.2) is valid for polynomials that have degree at most . They satisfy
[TABLE]
and more generally, with any factorization and ,
[TABLE]
Proof.
Following Apostol in [Apo51, Eq. (3.1)], write
[TABLE]
Then (1.4) may be expressed as
[TABLE]
where is summed over all primitive th roots of unity. It is clear from the form of (2.16) that is a polynomial in where, for fixed and , the polynomial depends only on . Hence
[TABLE]
The inner sum in (2.17) will be zero if is too small since for . For we have . Therefore the smallest value of that gives a possible nonzero value for the inner sum is . Hence we may assume in (2.17), proving the bound for the degree.
We have and, by a formula of Glaisher [Gla09, Sect. 97] (see also [O’S15, Prop. 3.2]),
[TABLE]
where is the Stirling number that denotes the number of ways to partition a set of size into non-empty subsets. For fixed the value of the inner sum in (2.17) is therefore in the field . This value is unchanged under any automorphism of , since the primitive th roots will just be permuted. It follows that this value is in the fixed field of all automorphisms and so rational. Finally, (2.13) and (2.14) follow from (2.17) and the identity
[TABLE]
2.2 Explicit waves
The formula (2.17) gives a convenient expression for the th wave, especially when combined with the result from [O’S15, Eq. (3.6)]:
[TABLE]
for all and all with for . Sylvester in [Syl82] and Glaisher in [Gla09] developed different descriptions for . For some details of this and further treatments see Dowker’s papers [Dowa, Dowb] and also [BGK01, FR02]. In [RF06, Eq. (46)] the waves are written in terms of Bernoulli and Eulerian polynomials of higher order. An interesting expression for the first wave that does not involve Bernoulli polynomials has recently appeared in [DV17].
For fixed and set
[TABLE]
A variation of a result of Glaisher using the Apostol coefficients (2.15) is the following, given in [O’S15, Eq. (4.8)].
Theorem 2.4**.**
For , and
[TABLE]
where the outer sum is over all primitive -th roots of unity .
This means of calculating is computationally faster than (2.17) when is large and the wave computations in Tables 1, 2, 3, 9 and 10 were carried out using (2.20). An efficient means of computing waves that avoids roots of unity is given in [SZ12].
For a simple example,
[TABLE]
We notice that all the coefficients of are positive (the same was true for in (1.3)) and this positivity continues in for increasing . However, it must eventually fail; as we see from Table 2, at least one of the coefficients of the polynomial is negative.
For we have by (2.13). In this case and we find, for instance with ,
[TABLE]
The third wave for is
[TABLE]
For large values of we may simplify the formula (2.20). When we have and hence
[TABLE]
As we saw in Proposition 2.3, (2.21) must be a rational number and for fixed and it depends only on . We next show how these rationals may be expressed more explicitly. Note also the similarity of (2.21) with the Fourier-Dedekind sums of [BDR02].
In the simplest case of (2.21)
[TABLE]
which was already given in [RF06, Eq. (47)]. The sum in (2.22) is over all primitive -th roots of unity. Such sums are called Ramanujan sums and may be evaluated, see [HW08, Thm. 271], as the integer
[TABLE]
where is the Möbius function, defined to be [math] unless is squarefree and otherwise to the power of the number of prime factors of (with ). The next result gives formulas for explicitly in terms of rationals when is or . Recall the Bernoulli polynomials from (1.6) with and .
Proposition 2.5**.**
For
[TABLE]
where in (2.25) we have and
[TABLE]
Proof.
We have already seen (2.23). With in (2.18) and (2.19) we find
[TABLE]
for any -th root of unity with . Summing over all primitive -th root of unity we have
[TABLE]
and (2.24) follows. For we have
[TABLE]
using the partial fraction decomposition for as in [O’S15, p. 735]. The first sum on the right of (2.27) has been found with (2.26). The second sum may be evaluated in the same way since
[TABLE]
and is a primitive -th root of unity if and only if is a primitive -th root of unity. The third sum on the right of (2.27) can be found similarly. Use in (2.19) and (2.18) to get
[TABLE]
It should be possible to find similar formulas for etc. When is a prime , Proposition 2.5 implies
[TABLE]
in the notation (1.2) and for . The identity (2.28) appears in [Cay56, p. 131]. Also
[TABLE]
for , where and .
2.3 General denumerants
The results in Section 2.1 may be extended in a straightforward manner to the general restricted partition problem considered by Cayley and Sylvester. Let be a fixed set of positive integers, not necessarily distinct, and write for the number of solutions to
[TABLE]
Our focus, , equals for . In general for ,
[TABLE]
where
[TABLE]
and, with a sum over all primitive -th roots of unity as before,
[TABLE]
Proposition 2.6**.**
For each wave , equation (2.32) is valid for polynomials that have degree at most one less than the number of elements of that are divisible by . With any factorization and , they satisfy
[TABLE]
3 Asymptotics for Sylvester waves
For and , Theorem 2.2 implies
[TABLE]
where we define to be [math] for and (-1)^{N+1}p_{N}\bigl{(}-n-N(N+1)/2\bigr{)} if . Put
[TABLE]
and for large we partition into three parts: , and the rest. The sum (3.1) becomes
[TABLE]
The sum over is the sum of the first waves
[TABLE]
Write the sum over , see [O’S16a, Eq. (1.21)], as
[TABLE]
With (3.3), (3.4) and (3.5) we may write our key identity as
[TABLE]
Since every in (3.5) is the residue of a simple pole, they may be calculated as in [O’S16a, Eq. (1.22)] to obtain
[TABLE]
where we used the reciprocal of the product
[TABLE]
with . The right side of (3.7) can be analyzed in great detail and its asymptotics found:
Theorem 3.1**.**
Let be a positive real number. Suppose and for satisfying . Then for and explicit we have
[TABLE]
for an implied constant depending only on and .
This theorem is proved in Section 5. The next result, on the last component of (3.6), is shown in Section 6.
Theorem 3.2**.**
Let be a positive real number. Suppose and for satisfying . Then for an implied constant depending only on ,
[TABLE]
These two results, combined with bounds for , imply Theorem 1.2:
Proof of Theorem 1.2.
Combining (3.6) with Theorems 3.1, 3.2 shows
[TABLE]
where . The estimate
[TABLE]
follows from and (1.9). Calculus shows the crude bound for any . Hence, with and , say,
[TABLE]
Therefore may be included in the error term in (3.11). This completes the proof of Theorem 1.2. ∎
4 Required results
4.1 The saddle-point method
We will apply Perron’s saddle-point method from [Per17] in Sections 5 and 7. The exact form we need is given in [O’S] and requires the following discussion to state it precisely.
The usual convention that the principal branch of has arguments in is used. As in (4.3) below, powers of nonzero complex numbers take the corresponding principal value for .
Our contours of integration will lie in a bounded region of and be parameterized by a continuous function that has a continuous derivative except at a finite number of points. For any appropriate , integration along the corresponding contour is defined as in the normal way.
We make the following assumptions and definitions.
Assumptions 4.1**.**
We have a neighborhood of . Let be a contour as described above, with a point on it. Suppose and are holomorphic functions on a domain containing . We assume is not constant and hence there must exist and so that
[TABLE]
with holomorphic on and . Let and we will need the steepest-descent angles
[TABLE]
We also assume that and are independent of . Finally, let be a bound for on .
Theorem 4.2** (The saddle-point method of Perron).**
Suppose Assumptions 4.1 hold and is even. Let be a contour beginning at , passing through and ending at , with these points all distinct. Suppose that
[TABLE]
Let approach in a sector of angular width about with bisecting angle , and initially leave in a sector of the same size with bisecting angle . Then for every ,
[TABLE]
as where the implied constant is independent of and . The numbers are given by
[TABLE]
.
Theorem 4.2 is proved as Corollary 5.1 in [O’S] with the innovation of making the error independent of . Note that [O’S] has with the opposite sign but all other notation, e.g. , is the same. The numbers depend on and , but we have highlighted the dependence on since we will be applying Theorem 4.2 with varying. Another description of may be given in terms of the power series for and near :
[TABLE]
This requires the partial ordinary Bell polynomials, [Com74, p. 136], which are defined with the generating function
[TABLE]
Clearly is for and is [math] for . Also
[TABLE]
for from [CFW87, p. 156] where the sum is over all possible , .
Proposition 4.3**.**
For defined in (4.3),
[TABLE]
Proposition 4.3 is due to Campbell, Fröman and Walles [CFW87, pp. 156–158]. The above formulation is proved in [O’S, Prop. 7.2]. Wojdylo also rediscovered this formula; see the references in [O’S]. The following result is [O’S, Prop. 7.3].
Proposition 4.4**.**
With Assumptions 4.1 and defined in (4.3),
[TABLE]
where is a bound for on . The positive constant and the implied constant in (4.8) are both independent of and .
4.2 The dilogarithm
As described in [Max03], [Zag07], [O’S16c] for example, the dilogarithm is initially defined as
[TABLE]
with an analytic continuation given by . This makes the dilogarithm a multi-valued holomorphic function with a branch points at (and off the principal branch another branch point at [math]). We let denote the dilogarithm on its principal branch so that is a single-valued holomorphic function on .
We may describe for on the unit circle as
[TABLE]
where is the second Bernoulli polynomial and
[TABLE]
is Clausen’s integral. Note that . The graph of resembles a slanted sine wave - see [O’S16c, Fig. 1], for example. Combine (4.10) and (4.11) to get, for with ,
[TABLE]
Then the right of (4.13) gives the continuation of to with .
As crosses the branch cuts the dilogarithm enters new branches. From [Max03, Sect. 3], the value of the analytically continued dilogarithm is always given by
[TABLE]
for some , .
The saddle-points we need in our asymptotic calculations are closely related to zeros of the analytically continued dilogarithm and in [O’S16c] we have made a study of its zeros on every branch. When the continued dilogarithm takes the form (4.14) with , there will be a zero if and only if and, for each such , the zero will be unique and lie on the real line. The cases we will require have . In these cases there are no real zeros so we may avoid the branch cuts and look for solutions to
[TABLE]
The next result is shown in Theorems 1.1 and 1.3 of [O’S16c].
Theorem 4.5**.**
For nonzero , (4.15) has solutions if and only if . For such a pair the solution is unique. This unique solution, , may be found to arbitrary precision using Newton’s method.
By conjugating (4.15) it is clear that
[TABLE]
So for nonzero the first zeros are and its conjugate . We have
[TABLE]
and this zero was denoted by in Section 1.2. We will also need
[TABLE]
Define
[TABLE]
a single-valued holomorphic function away from the vertical branch cuts for . Its first derivatives are
[TABLE]
The last result in this section is [O’S16a, Thm. 2.4] and identifies the saddle-points we will need.
Theorem 4.6**.**
Fix integers and with . Then there is a unique solution to for with and . Denoting this solution by , it is given by
[TABLE]
and satisfies
[TABLE]
5 Proof of Theorem 3.1
Proof of Theorem 3.1.
We require a modification of the proof of [O’S16a, Thm 1.6]. The following should be read alongside Sections 2-5 of [O’S16a] where there are more details. First define
[TABLE]
We approximate the reciprocal of the sine product , as defined in (3.8), with [O’S16a, Thm. 4.1], based on Euler-Maclaurin summation. A special case, see [O’S16a, Cor. 4.2], shows
[TABLE]
and
[TABLE]
with . The implied constants in (5.2), (5.3) are absolute. We may combine (3.7), (5.2) and (5.3) by first making the following definitions:
[TABLE]
We used (4.13) with to convert Clausen’s integral into the dilogarithm in (5.4). (Note that all the occurrences of the function in this section refer to (5.4) and not the partition function.) Then with define
[TABLE]
where the index notation means we are summing over all integers such that . It follows, as in [O’S16a, Eq. (4.11)], that for any and an absolute implied constant we have
[TABLE]
When we may remove the factor from \exp\bigl{(}v\left(z;N,\sigma\right)\bigr{)} and include it in the new function
[TABLE]
to get
[TABLE]
It is shown in [O’S16a, Prop. 4.7] that and \exp\bigl{(}v\left(z;N,0\right)\bigr{)} are holomorphic and absolutely bounded on a domain containing the box for
[TABLE]
Since it follows that
[TABLE]
with an implied constant depending only on . The proof of [O’S16a, Thm. 4.3] now goes through unchanged, except that we have and instead of . This theorem allows us to replace the sum (5.10) by the integral
[TABLE]
where, for an implied constant depending only on (coming from the bound (5.12)),
[TABLE]
The form of (5.13) allows us to find its asymptotic expansion using the saddle-point method as was done in [O’S16a]. We have seen in Theorem 4.6 that has a unique solution for given by z=1+\log\bigl{(}1-w(0,-1)\bigr{)}/(2\pi i). (The function is the case of .) In the notation of (1.12) we write and is the saddle-point .
In the notation of Assumptions 4.1 and Theorem 4.2, we find , and the steepest-descent angles are and . Let . We move the path of integration in (5.13) to the path consisting of the straight line segments joining the points and . This path passes through as shown in Figure 1. Since the integrand in (5.13) is holomorphic on a domain containing , Cauchy’s theorem ensures that the integral remains the same under this change of path. It is proved in [O’S16a, Thm. 5.2] that
[TABLE]
Recall from (1.15) and (4.20) that
[TABLE]
To apply the saddle-point method we state one further result, which is [O’S16a, Prop. 5.8]. Set and for put
[TABLE]
Proposition 5.1**.**
There are functions (defined above) and which are holomorphic on a domain containing the box and have the following property. For all ,
[TABLE]
with an implied constant depending only on where and .
Proposition 5.1 implies
[TABLE]
where, by (5.12), (5.15) and Proposition 5.1, the last term in the parentheses in (5.18) is
[TABLE]
for an implied constant depending only on . Applying Theorem 4.2 to each integral in the first part of (5.18) we obtain, since ,
[TABLE]
The error term in (5.19) corresponds to an error in (5.18) of size . Choose so that this error is less than for all . Therefore
[TABLE]
for implied constants depending only on and . (In going from the previous line to (5.20) we used that has a bound depending only on and , by Proposition 4.4, when .) Recall that by (5.8) and (5.14). Hence, with
[TABLE]
we obtain (1.17) in the statement of the theorem.
The first coefficient is
[TABLE]
using (4.3). The terms and are defined in (4.4) so that, using (4.18) and (5.5),
[TABLE]
Taking square roots (and numerically checking whether the sign should be or ),
[TABLE]
By (5.9) and (4.4), we have the power series
[TABLE]
This shows that
[TABLE]
Assembling (5.22), (5.24) and (5.26) proves that . This completes the proof of Theorem 3.1. ∎
Proposition 5.2**.**
We have
[TABLE]
Proof.
Formula (5.21) implies
[TABLE]
As in [O’S16a, Prop. 5.10], . Also (4.7) implies
[TABLE]
From (4.17), (4.18) and their generalizations we have
[TABLE]
Taking derivatives of and evaluating at shows that
[TABLE]
Then by (5.25),
[TABLE]
Putting this all together with the quantities and evaluated in (5.22) – (5.26), and simplifying with (1.12), finishes the proof. ∎
Table 4 gives examples of the accuracy of Theorem 3.1, showing the approximation to on the right side of (3.9) for and different values of and . The last column computes directly from (3.7).
6 Proof of Theorem 3.2
We prove Theorem 3.2 in this section; it will follow directly from Propositions 6.1, 6.5, 6.7 and 6.10. For , the indexing set in (3.10) may be partitioned into four pieces:
[TABLE]
where
[TABLE]
and is what is left. We see next that the sum of for is small enough that we may bound the absolute value of each term. Doing this with the sums over , and produces bounds that are larger than the main term of Theorem 3.1 and so we must use saddle-point methods for these.
6.1 Bounds for
Proposition 6.1**.**
Let be a positive real number. Suppose and for satisfying . For an implied constant depending only on ,
[TABLE]
Proof.
For and we have from [O’S16b, Prop. 3.4] that
[TABLE]
for and . Then (6.5) is used to prove, for an implied constant depending only on , that . This is [O’S16b, Thm. 3.5]. When , the only dependence in (6.5) is a factor . ∎
6.2 Bounds for
This section may be read alongside Sections 5 and 6 of [O’S16b]. Set
[TABLE]
where the equality in (6.6) uses (2.8) and requires . We next wish to show
[TABLE]
for a . In fact, the asymptotic expansion of is found in [O’S16b, Thm. 1.5] and implies (6.7), but with an implied constant depending on and hence on when takes the form . It is straightforward to rework the proof slightly (as we did for in Section 5) and prove (6.7) with an implied constant depending only on . We give the details of this next.
The sum (6.6) corresponds to and our treatment requires breaking this into two parts: for and with .
We establish an intermediate result for first, as follows. Recall from (5.4) and from (5.1). Define
[TABLE]
Proposition 6.2**.**
Let be a positive real number. Suppose and for satisfying . For an implied constant depending only on ,
[TABLE]
Proof.
The identity
[TABLE]
is [O’S16b, eq. (5.3)]. Set and define
[TABLE]
The sine product in (6.12) may be estimated precisely using Euler-Maclaurin summation as in [O’S16b, Thm. 5.1]. The result is that and differ by at most for an absolute implied constant. For we easily obtain
[TABLE]
It is shown in [O’S16b, Thm. 5.4] that and are holomorphic and absolutely bounded on a domain containing the box , defined in (5.11). Hence,
[TABLE]
with an implied constant depending only on . Using this bound, the proofs of Propositions 5.6 and 5.7 in [O’S16b] go through. This gives the desired result, expressing as the integral in (6.11). ∎
The second component, , is treated in a similar way as follows. Define
[TABLE]
for and .
Proposition 6.3**.**
Let be a positive real number. Suppose and for satisfying . For an implied constant depending only on ,
[TABLE]
Proof.
This time we set and define
[TABLE]
It is shown in [O’S16b, eq. (6.14)] that and differ by at most for an absolute implied constant. We may replace q^{*}_{\mathcal{C}}(z)\exp\bigl{(}v_{\mathcal{C}}^{*}(z;N,\sigma)\bigr{)} in (6.17) by f^{*}_{\mathcal{C},\lambda}(z)\exp\bigl{(}v_{\mathcal{C}}^{*}(z;N,\lambda/2)\bigr{)} since . Put
[TABLE]
and the next result is [O’S16b, Corollary 6.4].
Lemma 6.4**.**
For and all with , we have
[TABLE]
where and the implied constant depends only on .
With the above lemma we may show that f^{*}_{\mathcal{C},\lambda}(z)\exp\bigl{(}v_{\mathcal{C}}^{*}(z;N,\lambda/2)\bigr{)} is holomorphic on a domain containing , and that
[TABLE]
with an implied constant depending only on . The proof in Sections 6.2 and 6.3 of [O’S16b] now goes through and we obtain our integral representation (6.16). ∎
Proposition 6.5**.**
Let be a positive real number. Suppose and for satisfying . For an implied constant depending only on ,
[TABLE]
Proof.
We bound the integral representation (6.11) of by first moving the path of integration to one going through a saddle-point of . By Theorem 4.6, the unique solution to for is
[TABLE]
Let and make the polygonal path between the points , , and , as shown in Figure 1, passing through . It is proved in [O’S16b, Thm. 5.8] that
[TABLE]
Therefore, recalling (6.14),
[TABLE]
Bounding the integral representation (6.16) of is achieved similarly. By Theorem 4.6, the unique solution to for is
[TABLE]
Let and make the polygonal path between the points , , and , as shown in Figure 1, passing through . As seen in [O’S16b, Sect. 6.3],
[TABLE]
Therefore, recalling (6.19),
[TABLE]
Together, (6.22) and (6.23) prove (6.20). ∎
6.3 Bounds for
This section may be read alongside Section 7 of [O’S16b]. Write
[TABLE]
Recall from (5.1) and define
[TABLE]
for and . Also set
[TABLE]
Proposition 6.6**.**
Let be a positive real number. Suppose and for satisfying . Then
[TABLE]
for odd. Also
[TABLE]
for even. The implied constants in (6.26) and (6.27) depend only on ,
Proof.
For odd, the summands in (6.24) satisfy the identity
[TABLE]
which is [O’S16b, Eq. (7.2)]. Next put and
[TABLE]
for odd. It is shown in [O’S16b, Eq. (7.30)] that and differ by at most for an absolute implied constant. With we substitute
[TABLE]
in (6.29). It follows from [O’S16b, Thm. 7.5] that f_{\mathcal{D},\lambda}(z)\exp\bigl{(}v_{\mathcal{D}}(z;N,0)\bigr{)} is holomorphic on a domain containing and
[TABLE]
with an implied constant depending only on . The proof in Section 7.2 of [O’S16b] now goes through and we obtain our integral representation (6.26). The case where is even is very similar - see Section 7.3 of [O’S16b] - using
[TABLE]
∎
Proposition 6.7**.**
Let be a positive real number. Suppose and for satisfying . Then for an implied constant depending only on ,
[TABLE]
Proof.
Change the path of integration in (6.26) and (6.27) to , as described in Section 5. We saw there that
[TABLE]
It now follows from (6.30) (and the analogous bound for even) that
[TABLE]
(as in (1.15), (5.16)) and we have completed the proof. ∎
6.4 Bounds for
This section may be read alongside Section 8 of [O’S16b]. Put
[TABLE]
To express (6.34) as an integral we need the next definitions. First set
[TABLE]
Then we define the function in the following way:
[TABLE]
and for
[TABLE]
Clearly, only depends on . With given in (6.8), put
[TABLE]
for and finally define
[TABLE]
Proposition 6.8**.**
Let be a positive real number. Suppose and for satisfying . Then for an implied constant depending only on ,
[TABLE]
Proof.
For and , we know by [O’S16b, Eqs. (8.3), (8.4)] that
[TABLE]
where
[TABLE]
Let again. It is shown in [O’S16b, Sections 8.3, 8.4] that
[TABLE]
with error term satisfying
[TABLE]
where as in the definition of . Recalling (6.10), we next set
[TABLE]
It is proved in [O’S16b, Prop. 8.5] (using (6.40) and (6.41)) that for an implied constant depending only on . To adapt this to the case that , we need the next result.
Lemma 6.9**.**
For , and an implied constant depending only on
[TABLE]
Proof.
Verify that when . This implies
[TABLE]
The proof of [O’S16b, Prop. 8.5] with and the bound from Lemma 6.9 now shows that
[TABLE]
for an implied constant depending only on . Replacing by also lets us rewrite as
[TABLE]
with
[TABLE]
In this way, is always independent of , and only depends on when . We easily obtain
[TABLE]
With the help of [O’S16b, Lemma 8.6] we see that f_{\mathcal{E},\lambda}(z;N)\exp\bigl{(}v_{\mathcal{C}}(z;N,0)\bigr{)} is holomorphic on a domain containing and that
[TABLE]
with an implied constant depending only on . The proof in Section 8.4 of [O’S16b] now goes through and we obtain our integral representation (6.37). ∎
Proposition 6.10**.**
Let be a positive real number. Suppose and for satisfying . Then for an implied constant depending only on ,
[TABLE]
Proof.
As in the first part of the proof of Proposition 6.5, we move the path of integration of (6.37) to passing through the saddle-point . As we have seen in (6.21) and (6.22),
[TABLE]
for . Combining this bound with (6.44) completes the proof. ∎
This last proposition completes the proof of Theorem 3.2. This finishes the proof of Theorem 1.2 as well.
7 Asymptotic expansions for , and
We may continue the analysis of , and to obtain their asymptotic expansions. While not necessary to prove Theorem 3.2, this allows us to numerically verify our work, as we see in Tables 5 - 8, and also suggests some further results that we describe in Section 9.
Recall the dilogarithm zeros and from Section 4.2. Starting with Proposition 6.2, a similar proof to Theorem 3.1 shows the asymptotic expansion of , the first component of . Details are much the same as [O’S16b, Sect. 5.4]. The functions and are defined in (5.17) and (6.9), respectively.
Theorem 7.1**.**
Let be a positive real number. Suppose and for satisfying . We have
[TABLE]
for an implied constant depending only on and . The functions are given as follows, where depends on with saddle-point ,
[TABLE]
A comparison of both sides of (7.1) in Theorem 7.1 with some different values of and is shown in Table 5. The asymptotic expansion of , the second component of , is given next based on a similar development in [O’S16b, Sect. 6.4]. Recall from (6.15) and from (6.18). Set and for put
[TABLE]
Theorem 7.2**.**
Let be a positive real number. Suppose and for satisfying . We have
[TABLE]
for an implied constant depending only on and . The functions are given as follows, where depends on with saddle-point ,
[TABLE]
The detailed expansion of is derived similarly to Section 7 of [O’S16b]. We need from (6.25). Also set
[TABLE]
and
[TABLE]
with .
Theorem 7.3**.**
Let be a positive real number. Suppose and for satisfying . With denoting , we have
[TABLE]
for an implied constant depending only on and . The functions d_{t}\bigl{(}\lambda,\overline{N}\bigr{)} are given as follows, where depends on with saddle-point ,
[TABLE]
The asymptotic expansion of is proved analogously to [O’S16b, Sect. 8]. The functions and are defined in (6.36), (6.43) and (5.17) respectively.
Theorem 7.4**.**
Let be a positive real number. Suppose and for satisfying . We have
[TABLE]
for an implied constant depending only on and . The functions are given as follows, where depends on with saddle-point ,
[TABLE]
8 When waves are good approximations to partitions
8.1 Proof of Theorem 1.4
We first show upper and lower bounds for p_{N}\bigl{(}\lambda N^{2}\bigr{)}.
Lemma 8.1**.**
For positive integers and absolute implied constants
[TABLE]
Proof.
The upper bound follows from and (1.9). For the lower bound we start with
[TABLE]
from, for example, [Sze51, p. 86]. Stirling’s formula implies as , so we see that the left side of (8.2) is
[TABLE]
for . Now use that for to show
[TABLE]
and we have proved the lower bound. ∎
Proof of Theorem 1.4.
With in (3.1) and (3.4), we have
[TABLE]
where the second sum is over all . With (5.7) and (5.8), the sum over is bounded by an absolute constant times the absolute value of
[TABLE]
where as before. We know that q\left(z\right)\exp\bigl{(}v\left(z;N,0\right)\bigr{)}\ll 1 by (5.12) with . For and
[TABLE]
and the right side of (8.6) is bounded by for . Consequently, (8.5) is bounded by an absolute constant times
[TABLE]
Similar reasoning, using (6.13), (6.17), (6.29), (6.31) and (6.42), shows the sums over , and are also .
From the proof of Proposition 6.1 we find that the sum over is . Therefore
[TABLE]
Next, we divide both sides of (8.7) by p_{N}\bigl{(}\lambda N^{2}\bigr{)} and use the lower bound of (8.1). Since
[TABLE]
for we obtain
[TABLE]
and the result follows easily. ∎
8.2 Good approximations for or small
In Figure 2 we see how closely matches for relatively small . We know that the first waves oscillate with periodicity of length for large and this periodicity is already visible in the figure. Our computations show, for example, that
[TABLE]
The smallest value of for occurs when , giving the very accurate approximation
[TABLE]
For the initial agreement between and is even more impressive. For example,
[TABLE]
For it is . We computed the restricted partition above by relating it to with the formula
[TABLE]
This follows since we must remove from the partitions in those with largest part of size . The partition function may be easily calculated using (1.8).
Examples of Theorem 1.2 with are shown in Table 9. This shows that after about the first wave begins to grow more rapidly than and follows the expected asymptotics. See also the bottom row in Table 3 for more on the case.
We can offer the following explanation for why there is such good initial agreement between and the first waves. From (3.11) in the proof of Theorem 1.2 we know that
[TABLE]
recalling (1.15), (1.18) and (1.19). For small , is the largest term on the right of (8.8). This means the first waves will be close to . However p_{N}(\lambda N)\ll\exp(\bigl{(}2\pi\sqrt{|\lambda|/6}\bigr{)}\sqrt{N}) as in (3.12) which implies that, for any given , the second term on the right of (8.8) will always eventually dominate and hence provide the asymptotics for the first waves as .
9 Future work
As we noted in Section 1.2, the main results of Theorems 1.1, 1.2, 1.4 and Corollary 1.3 should be true with the sum over the first waves replaced by just the first wave. Hence Theorem 1.2 becomes:
Conjecture 9.1**.**
Let be a positive real number. Suppose and for satisfying . Then
[TABLE]
where the coefficients are given in (5.21) and the implied constant depends only on and .
We have already seen evidence for this conjecture in Table 3. Its proof would require an improvement in Proposition 6.1; the techniques of [Sze51] or [DG14] might allow a careful enough estimate of . Strengthening Proposition 6.1 would also increase the allowable range of for Theorem 1.4.
Numerical experiments reveal that matches for large and we expect their asymptotic expansions are the same:
Conjecture 9.2**.**
Let be a positive real number. Suppose and for satisfying . Then with denoting , we have
[TABLE]
for an implied constant depending only on and . The functions d_{t}\bigl{(}\lambda,\overline{N}\bigr{)} are given in (7.5) and (7.6).
Table 10 gives examples and the agreement for odd is similar. Conjecture 9.2 is the analog of [O’S16a, Conj. 6.4] for the Rademacher coefficients. Conjectures 9.1 and 9.2 together imply that squared is approximately for large .
Comparing Tables 5 and 8, we see that the entries for in Table 8 are exactly times the entries for in Table 5. The following is based on further numerical evidence.
Conjecture 9.3**.**
The quantities and , given by
[TABLE]
respectively, have the same asymptotic expansion as . In other words, recalling (7.2), (7.8), we have for all .
We may finally ask how our asymptotic results extend to other examples of the more general waves of Section 2.3.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[Apo 51] T. M. Apostol. On the Lerch zeta function. Pacific J. Math. , 1:161–167, 1951.
- 2[BDR 02] Matthias Beck, Ricardo Diaz, and Sinai Robins. The Frobenius problem, rational polytopes, and Fourier-Dedekind sums. J. Number Theory , 96(1):1–21, 2002.
- 3[BGK 01] Matthias Beck, Ira M. Gessel, and Takao Komatsu. The polynomial part of a restricted partition function related to the Frobenius problem. Electron. J. Combin. , 8(1):Note 7, 5 pp. (electronic), 2001.
- 4[Cay 56] Arthur Cayley. Researches on the partition of numbers. Philos. Trans. R. Soc. Lond. , 146:127–140, 1856.
- 5[CFW 87] John A. Campbell, Per Olof Fröman, and Erik Walles. Explicit series formulae for the evaluation of integrals by the method of steepest descents. Stud. Appl. Math. , 77(2):151–172, 1987.
- 6[Com 74] Louis Comtet. Advanced combinatorics . D. Reidel Publishing Co., Dordrecht, enlarged edition, 1974. The art of finite and infinite expansions.
- 7[DG 14] Michael Drmota and Stefan Gerhold. Disproof of a conjecture by Rademacher on partial fractions. Proc. Amer. Math. Soc. Ser. B , 1:121–134, 2014.
- 8[Dowa] J. S. Dowker. On Sylvester waves and restricted partitions. ar Xiv: 1302.6172.
