We give a new proof of Vinogradov's three primes theorem, which asserts that all sufficiently large odd positive integers can be written as the sum of three primes. Existing proofs rely on the theory of $L$-functions, either explicitly or implicitly. Our proof is sieve theoretical and uses a transference principle, the idea of which was first developed by Green [Ann. of Math. (2) 161 (3) (2005), 1609-1636] and used in the proof of Green and Tao's theorem [Ann. of Math. (2) 167 (2) (2008), 481-547]. To make our argument work, we also develop an additive combinatorial result concerning popular sums, which may be of independent interest.
|Journal||Forum of Mathematics, Sigma|
|State||Published - Feb 1 2014|
Bibliographical notePublisher Copyright:
© 2014 Cambridge. All rights reserved.
ASJC Scopus subject areas
- Theoretical Computer Science
- Algebra and Number Theory
- Statistics and Probability
- Mathematical Physics
- Geometry and Topology
- Discrete Mathematics and Combinatorics
- Computational Mathematics