Sums of almost equal squares of primes
Angel Kumchev, Taiyu Li

TL;DR
This paper investigates the representation of large integers as sums of almost equal prime squares, improving bounds and extending results for different numbers of terms using sieve methods and number theory techniques.
Contribution
It introduces new bounds for representing integers as sums of prime squares with almost equal terms, extending previous work and providing first estimates for certain cases.
Findings
For s=5, all large integers ≡ 5 mod 24 are representable with θ > 8/9.
Improved estimates for integers with s=3,4 satisfying local conditions.
Extended previous results and provided first estimates for specific cases.
Abstract
We study the representations of large integers as sums , where are primes with , for some fixed . When we use a sieve method to show that all sufficiently large integers can be represented in the above form for . This improves on earlier work by Liu, L\"{u} and Zhan, who established a similar result for . We also obtain estimates for the number of integers satisfying the necessary local conditions but lacking representations of the above form with . When our estimates improve and generalize recent results by L\"{u} and Zhai, and when they appear to be first of their kind.
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
TopicsAnalytic Number Theory Research · Limits and Structures in Graph Theory · Algebraic Geometry and Number Theory
