The density of integers representable as the sum of four prime cubes
Christian Elsholtz, Jan-Christoph Schlage-Puchta

TL;DR
This paper establishes a new lower bound on the density of integers that can be expressed as the sum of four prime cubes, improving previous bounds and advancing understanding of prime representations.
Contribution
It provides an improved lower bound on the density of integers representable as the sum of four prime cubes, surpassing earlier known bounds.
Findings
Lower density bound at least 0.009664
Improves previous bounds of 0.003125 and 0.005776
Advances knowledge on prime sum representations
Abstract
The set of integers which can be written as the sum of four prime cubes has lower density at least . This improves earlier bounds of by Ren and by Liu.
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.
The density of integers representable as the sum of four prime cubes
Christian Elsholtz
Christian Elsholtz, Institut für Analysis und Zahlentheorie, Technische Universität Graz, A-8010 Graz, Austria
and
Jan-Christoph Schlage-Puchta
Jan-Christoph Schlage-Puchta, Mathematical institute, University Rostock, 18957 Rostock, Germany
Abstract.
The set of integers which can be written as the sum of four prime cubes has lower density at least . This improves earlier bounds of by Ren and by Liu.
1. Introduction and results
The main result of this article is the following.
Theorem 1**.**
The set of integers which can be written as the sum of four prime cubes has lower density .
The same result had been obtained by Ren [3] with a density of 0.003125, which had been improved by Liu [2] to 0.005776. Note that apart from a set of density 0, an integer, which is representable as the sum of four prime cubes satisfies the congruence conditions , , , thus the density of all integers of this form cannot be larger than .
The proof follows essentially the work of Ren [3], with considerably more precise estimates of an eight-dimensional integral and the singular series. Define , , , and denote by the number of representations of as , where , . (Note that the choice of the exponent goes back to Vaughan [5].) Observe that
[TABLE]
where . Let . For very small one can approximately think of . Then the following holds:
Proposition 2**.**
We have
[TABLE]
where , for sufficiently small .
Theorem 1 follows from Proposition 2 by a simple application of Cauchy’s inequality. Proposition 2 can also be used to give estimates for integrals occurring in applications of the circle method. We do not go into details here, but refer the reader to the paper [4] by Liu and Lü.
We have
[TABLE]
To bound the quantity on the right we use an upper bound sieve, that is, we first consider the set of all integers , such that , and then we sift out the possible prime values. To do so we need information on the distribution of the elements of in residue classes.
Define as the number of solutions of the equation with , .
We would expect that is asymptotically equal to a local factor given by some singular series multiplied by a global factor given by an integral involving the density of the prime numbers. Unfortunately, we cannot prove this. In fact, we cannot even prove an asymptotic formula for the number of representations of an integer as the sum of 7 cubes. However, if we average over residue classes, then we can prove such a result. This is sufficient, as a linear sieve only requires information on the mean values . The archimedian part of the asymptotic formula for this sum is given by the integral
[TABLE]
where
[TABLE]
while the singular series is
[TABLE]
where
[TABLE]
and
[TABLE]
To summarize these considerations: the estimation of falls into four tasks:
- (1)
estimate the distribution of on residue classes 2. (2)
estimate 3. (3)
estimate 4. (4)
apply an upper bound sieve. For this last step we use the weighted version of Iwaniecs’s sieve due to Kawada and Wooley.
2. Step 1
For the first part we use results by Ren [3] and Liu [2] as follows.
Define by means of the equation
[TABLE]
Then we have the following:
Lemma 3**.**
- (1)
* is absolutely convergent and bounded independently of .* 2. (2)
Let be fixed and let denote the divisor function. For all complex numbers satisfying and for all fixed the following estimate holds:
[TABLE]
The first part of the statement is contained in Ren’s result [3, Lemma 3.2], the second statement is due to Liu [2, Lemma 3.2].
3. Step 2
We now compute .
Lemma 4**.**
We have .
Proof.
As each of the variables varies over its range of integration in , it changes by a factor 8 at most. Hence its logarithm changes by , and therefore
[TABLE]
and
[TABLE]
We conclude that
[TABLE]
where . If we replace by , the range of the innermost integral changes by . Since the integrand is , and the range of the first six integrals is , this change in the range introduces an error , which is of smaller order of magnitude than . The change of the innermost integrand is
[TABLE]
The total range of integration has measure , and the factors outside the innermost integral are , hence this change introduces an error of magnitude , which is also negligible. Hence
[TABLE]
The triple integral can be computed numerically to be in the range . We conclude that
[TABLE]
provided that is sufficiently large. ∎
The reader might wonder why we did not integrate numerically from the start, however, giving a provable bound for an eight dimensional integral is quite a delicate task.
4. Steps 3 and 4
We now apply the weighted version of Iwaniec’s sieve due to Kawada and Wooley (see [1, Lemma 9.1]). We do not want to go into details here, as the computations are the same as in the work of Ren [3, Lemma 4.17]. We obtain
[TABLE]
where is Euler’s constant, and
[TABLE]
The singular series mentioned in the introduction enters into the sieve, its contribution can be seen in the structure of the product . We have
[TABLE]
Using Mertens’ estimate and the fact that converges we obtain for
[TABLE]
provided that is sufficiently small.
If , then . If , then we have by Weil-estimates , and therefore . Hence
[TABLE]
and we see that the product over converges so fast that it can easily be evaluated numerically.
More precisely we have
[TABLE]
where .
Using we obtain , and write
[TABLE]
Plugging this value into the estimate above we obtain
[TABLE]
Similarly we can estimate as
[TABLE]
5. Putting these results together
Putting these results together we obtain
[TABLE]
and the proof of Proposition 2 is complete.
To deduce Theorem 1 we apply the Cauchy-Schwarz inequality in much the same way as in the proof of Romanov’s theorem. We have
[TABLE]
thus
[TABLE]
for sufficiently small . Patching intervals of the form together Theorem 1 follows by multiplying the last density with .
The authors would like to thank the referee for useful comments on the manuscript.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] K. Kawada, T. Wooley, On the Waring-Goldbach problem for fourth and fifth powers, Proc. London Math. Soc. 83 (2001), 1–50.
- 2[2] Z. Liu, Density of the sums of four cubes of primes, J Number Theory 132 (2012), 735–747.
- 3[3] X. Ren, Sums of four cubes of primes, J. Number theory 98 (2003), 156–171.
- 4[4] Z. Liu, G. Lü, Eight cubes of primes and powers of 2, Acta Arith. 145 (2010), 171–192.
- 5[5] R.C. Vaughan, Sums of three cubes. Bull. London Math. Soc. 17 (1985), 17–20.
