Vinogradov three prime theorem with Piatetski-Shapiro primes
Yu-Chen Sun, Shanshan Du, Hao Pan

TL;DR
This paper proves that sufficiently large odd numbers can be expressed as sums of three Piatetski-Shapiro primes within certain exponents, extending the classical Vinogradov theorem to a new prime subset.
Contribution
It introduces a novel approach combining Green's transference principle, Bourgain's restriction estimates, and Harman's sieve to handle Piatetski-Shapiro primes in Vinogradov's theorem.
Findings
Established representation of large odd numbers as sums of three Piatetski-Shapiro primes.
Extended Vinogradov's theorem to primes of the form loor(n^{c_i}) for specific c_i.
Developed new bounds and methods for primes with fractional power constraints.
Abstract
We prove that, for any , every sufficiently large odd number can be represented as the sum of three primes such that for some for each . Our arguments are based on a variant of Green's transference principle due to Matom\"aki, Maynard and Shao. We prove a necessary restriction estimate using Bourgain's strategy and employ Harman's sieve method to optimize our upper bound for .
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 · History and Theory of Mathematics · Algebraic Geometry and Number Theory
