Sums of four prime cubes in short intervals
Alessandro Languasco, Alessandro Zaccagnini

TL;DR
This paper establishes an improved asymptotic formula for counting integers that can be expressed as the sum of four prime cubes within shorter intervals than previously possible.
Contribution
It provides a new asymptotic formula for the average number of representations of integers as sums of four prime cubes in shorter intervals.
Findings
Proves an asymptotic formula for sums of four prime cubes
Improves interval length bounds for such representations
Enhances understanding of prime cube representations in short intervals
Abstract
We prove that a suitable asymptotic formula for the average number of representations of integers , where are prime numbers, holds in intervals shorter than the the ones previously known.
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.
Sums of four prime cubes in short intervals
Alessandro Languasco and Alessandro Zaccagnini
Abstract.
We prove that a suitable asymptotic formula for the average number of representations of integers , where are prime numbers, holds in intervals shorter than the the ones previously known.
Key words and phrases:
Waring-Goldbach problem, Hardy-Littlewood method
2010 Mathematics Subject Classification:
Primary 11P32; Secondary 11P55, 11P05
1. Introduction
Let be a sufficiently large integer and an integer. Let
[TABLE]
be a suitable short interval average of the number of representation of an integer as a sum of four prime cubes. The problem of representing integers as sum of prime cubes is quite an old one; we recall that Hua [4]-[5] stated that almost all positive integers satisfying some necessary congruence conditions are the sum of five prime cubes and that Daveport [2] proved that almost all positive integers are the sum of four positive cubes. More recent results on the positive proportions of integers that are the sum of four prime cubes were obtained by Roth [13], Ren [11] and Liu [9]. In fact, see Brüdern [1], it is conjectured that all sufficiently large integers satisfying some necessary congruence conditions are the sum of four prime cubes. Here we prove that
Theorem 1.
Let , be integers. Then, for every , there exists such that
[TABLE]
uniformly for , where is Euler’s function.
This should be compared with a recent result about the positive proportion of such integers in short intervals by Liu-Zhao [8] which holds for . As an immediate consequence of Theorem 1 we can say that, for sufficiently large, every interval of size larger than contains the expected amount of integers which are a sum of four prime cubes. We remark that this level is essentially optimal given the known density estimates for the non trivial zeroes of the Riemann zeta function. Assuming the Riemann Hypothesis (RH) holds we can further improve the size of .
Theorem 2.
Let , , be integers and assume the Riemann Hypothesis (RH) holds. Then there exists a constant such that
[TABLE]
as , uniformly for , where means and is Euler’s function.
As an immediate consequence of Theorem 2 we can say that, for sufficiently large, every interval of size larger than contains the expected amount of integers which are a sum of four prime cubes. We remark that this level is essentially optimal given the spacing of the cubic sequence.
In both the proofs of Theorems 1-2 we will use the original Hardy-Littlewood generating functions to exploit the easier main term treatment they allow (comparing with the one which would follow using Lemmas 2.3 and 2.9 of Vaughan [14]).
2. Setting
Let , , , ,
[TABLE]
We remark that
[TABLE]
We further set
[TABLE]
and, moreover, we also have the usual numerically explicit inequality
[TABLE]
see, e.g., on page 39 of Montgomery [10]. We list now the needed preliminary results.
Lemma 1 (Lemma 3 of [6]).
Let be an integer. Then
Lemma 2.
Let be an integer, and . Then
[TABLE]
where runs over the non-trivial zeros of .
Proof. It follows the line of Lemma 2 of [7]; we just correct an oversight in its proof. In eq. (5) on page 48 of [7] the term is missing. Its estimate is trivially . Hence such an oversight does not affect the final result of Lemma 2 of [7].
Lemma 3 (Lemma 4 of [7]).
Let be a positive integer and . Then
[TABLE]
uniformly for .
Lemma 4.
Let be an arbitrarily small positive constant, be an integer, be a sufficiently large integer and . Then there exists a positive constant , which does not depend on , such that
[TABLE]
uniformly for . Assuming RH we get
[TABLE]
uniformly for .
Proof. It follows the line of Lemma 3 of [7] and Lemma 1 of [6]; we just correct an oversight in their proofs which is based on Lemma 2 above. Both eq. (8) on page 49 of [7] and eq. (6) on page 423 of [6] should read as
[TABLE]
where , and is a suitable integer satisfying . The remaining part of the proofs are left untouched. Hence such oversights do not affect the final result of Lemma 3 of [7] and Lemma 1 of [6].
In the unconditional case a crucial role is played by
Lemma 5 (Hua).
Let be sufficiently large, integers, , . There exists a suitable positive constant such that
[TABLE]
Proof. We just prove the first part since the second one follows immediately by remarking that the primes are supported on a thinner set than the prime powers. Let . A direct estimate gives . Recalling that the Prime Number Theorem implies , a partial integration argument gives
[TABLE]
Using the inequality , Hölder’s inequality and interchanging the integrals, we get that
[TABLE]
Theorem 4 of Hua [5] implies, remarking that the von Mangoldt function is supported on a thinner set than the integers and inserts a logarithmic weight whose total contribution can be inserted in the power of , that there exists a positive constant such that . Using such an estimate and remarking that , we obtain that
[TABLE]
by a direct computation. This proves the first part of the lemma.
In fact the argument used in the proof of Lemma 5 can be used to derive other estimates on from the ones on . Another instance of this fact is the following lemma about the truncated fourth-mean average of which is based on a result by Robert-Sargos [12].
Lemma 6.
Let , , and . Then we have
[TABLE]
Proof. We can argue as in the proof of Lemma 5 using Lemma 4 of [3] on instead of Theorem 4 of Hua [5].
The last lemma is a consequence of Lemma 6.
Lemma 7.
Let , , , and . Then we have
[TABLE]
Proof. By partial integration and Lemma 6 we get that
[TABLE]
since . A similar computation proves the result in too. The estimate on can be obtained analogously.
3. The unconditional case
Let , where
[TABLE]
Letting , and recalling (1), we have
[TABLE]
say. Now we evaluate these terms.
3.1. Estimation of
Using (3) and Lemma 7 with and , we obtain
[TABLE]
provided that .
3.2. Estimation of
Clearly
[TABLE]
Hence by Lemma 1 we have
[TABLE]
say. By (3) we get
[TABLE]
say. Using the Hölder inequality and Lemma 6 with and we get
[TABLE]
provided that . Using the Hölder inequality and Lemma 7 with and we get
[TABLE]
provided that . Combining (8)-(10) we obtain
[TABLE]
provided that . An analogous computation gives
[TABLE]
and, by (7) and (11)-(12), we can finally write
[TABLE]
provided that .
3.3. Evaluation of
Since , we have that
[TABLE]
say. By (2)-(3) and Lemma 3, a direct calculation gives
[TABLE]
From now on, we denote By , (2) and we get
[TABLE]
[TABLE]
say. By (3) and Lemma 4 we obtain that, for every , there exists such that
[TABLE]
provided that , i.e., . By the Cauchy-Schwarz inequality, (2) and (18) we obtain that, for every , there exists such that
[TABLE]
provided that . By using twice the Cauchy-Schwarz inequality, Lemma 5, (2) and (18) we obtain that, for every , there exists such that
[TABLE]
provided that . Hence by (17)-(20) we finally can write that, for every , there exists such that
[TABLE]
provided that . Summing up, by (14)-(15) and (21) we have that, for every , there exists such that
[TABLE]
provided that .
3.4. Final words
Summing up, by (5)-(6), (13) and (22) we have that, for every , there exists such that
[TABLE]
provided that . The second error term is dominated by the first one since by (4). Hence we can write that, for every , there exists such that
[TABLE]
provided that . From for , , we get that, for every , there exists such that
[TABLE]
provided that and . Using and (23), the last error term is . Hence we get that, for every , there exists such that
[TABLE]
provided that . Theorem 1 follows by rescaling .
4. The conditional case
From now on we assume the Riemann Hypothesis holds. Comparing with section 3 we can simplify the setting. Recalling (1) and , we have
[TABLE]
say. Now we evaluate these terms.
4.1. Evaluation of
By Lemma 3, a direct calculation gives
[TABLE]
4.2. Estimate of
Recall that Using we can write that
[TABLE]
Hence
[TABLE]
say. Let
[TABLE]
By (3), Lemma 4 and a partial integration we obtain
[TABLE]
[TABLE]
By the Cauchy-Schwarz inequality, (2)-(3) and (27), we obtain
[TABLE]
By the Cauchy-Schwarz inequality we obtain
[TABLE]
Again by the Cauchy-Schwarz inequality, (2)-(3) and (27), we obtain
[TABLE]
Summing up by (26) and (28)-(30), we can finally write that
[TABLE]
4.3. Estimate of
It is clear that of section 3.2. Hence by (13) we obtain
[TABLE]
4.4. Final words
Summing up, by (24)-(25), (31) and (32), there exists such that we have
[TABLE]
which is an asymptotic formula . From for , , we get
[TABLE]
Using and (33), the last error term is . Hence we get
[TABLE]
uniformly for , . Theorem 2 follows.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] J. Brüdern, A sieve approach to the Waring-Goldbach problem. I. Sums of four cubes , Ann. Sci. École Norm. Sup. (4) 28 (1995), 461–476.
- 2[2] H. Davenport, On Waring’s problem for cubes , Acta Math. 71 (1939), 123–143.
- 3[3] A. Gambini, A. Languasco, and A. Zaccagnini, A diophantine approximation problem with two primes and one k-power of a prime , J. Number Theory 188 (2018), 210–228.
- 4[4] L. K. Hua, Some results in the additive prime number theory , Quart. J. Math. Oxford 9 (1938), 68–80.
- 5[5] L. K. Hua, Additive theory of prime numbers , Trans. Math. Monographs, vol. 13, A.M.S., 1965.
- 6[6] A. Languasco and A. Zaccagnini, Short intervals asymptotic formulae for binary problems with primes and powers, II: density 1 1 1 , Monatsh. Math. 181 (2016), 419–435.
- 7[7] A. Languasco and A. Zaccagnini, Sum of one prime and two squares of primes in short intervals , J. Number Theory 159 (2016), 1945–1960.
- 8[8] H. Liu and F. Zhao, Density of integers that are the sum of four cubes of primes in short intervals , Acta Math. Hungar. 151 (2017), 8–23.
