Hua's theorem on five almost equal prime squares (Q2508613): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On estimations of trigonometric sums over primes in short intervals. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: On estimations of trigonometric sums over primes in short intervals. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: On estimations of trigonometric sums over primes in short intervals. III / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the representation of large odd integer as a sum of three almost equal primes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The three primes theorem with almost equal summands / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sums of five almost equal prime squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on sums of five almost equal prime squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sums of five almost equal prime squares. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a sum of three prime squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: The exceptional set in the four prime squares problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hua's theorem on prime squares in short intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: The exceptional set in Hua's theorem for three squares of primes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sums of five almost equal prime squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hua's theorem with five amost equal prime variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quadratic Waring-Goldbach problem / rank
 
Normal rank

Latest revision as of 20:45, 24 June 2024

scientific article
Language Label Description Also known as
English
Hua's theorem on five almost equal prime squares
scientific article

    Statements

    Hua's theorem on five almost equal prime squares (English)
    0 references
    0 references
    13 October 2006
    0 references
    The author's aim in this paper is to show that any sufficiently large integer~\(N\) satisfying a necessary congruence condition \(N \equiv 5, \bmod\,24\) is representable as a sum of five almost equal squares of primes~\(p_ j\): that is to say one seeks to make each \(p_ j\) satisfy \(\bigl| p_ j-\sqrt{N/5}\,\bigr| \leq U\) with \(U\) somewhat smaller than~\(\sqrt N\): \(U=N^ {{1\over2}-\delta}\), say. Thus \(\delta\) should be made as large as possible. All the known results have been obtained by various developments of the circle method. Recently, in [Chin. Ann. Math., Ser. B 26, No. 2, 291--304 (2005; Zbl 1101.11043)] the author established such a result with \(\delta={1\over35}-\varepsilon\) if \(\varepsilon>0\), improving on results of \textit{J.~Y.~Liu} and \textit{T.~Zhan} [Sci. China, Ser. A 41, No. 7, 710--722 (1998; Zbl 0938.11048)], and of \textit{C.~Bauer} [Acta Math. Sin., Engl. Ser. 21, No. 4, 833--840 (2005; Zbl 1101.11041)]. This improvement by the author depended on some innovations, also by \textit{J.~Y.~Liu} [Q.~J. Math.~54, No.4, 453--462 (2003; Zbl 1080.11071)], introduced in connection with the related problem of bounding the ``exceptional set'' of numbers not expressible as a sum of \textit{four} squares of primes but satisfying the appropriate necessary congruence condition. For this related problem, further improvements have now been made by \textit{J.~Y.~Liu, T.~D.~Wooley} and \textit{G.~Yu} [J. Number Theory 107, No. 2, 298--321 (2004; Zbl 1056.11055)]. In the paper under review the author uses ideas drawn from the work of Liu, Wooley and~Yu to obtain a further improvement in which the result has \(\delta={1\over28}-\varepsilon\). The reviews cited above contain an indication of the nature of some of the techniques involved.
    0 references
    circle method
    0 references
    additive theory of prime numbers
    0 references

    Identifiers