Vinogradov's theorem with almost equal summands

Abstract

Let $\theta >11/20$. We prove that every sufficiently large odd integer $n$ can be written as a sum of three primes $n=p_1+p_2+p_3$ with $|p_i-n/3|\le n^{\theta }$ for $i\in \{1,2,3\}$.

27 pages

References in corpus (1)

• Vinogradov's three primes theorem with almost twin primes

Cited by in corpus (11)

• Higher uniformity of arithmetic functions in short intervals I. All intervals
• Discorrelation between primes in short intervals and polynomial phases
• A Density version of Waring's problem
• Vinogradov's Theorem with Fouvry-Iwaniec Primes
• Waring-Goldbach problem in short intervals
• On the Frobenius number of certain numerical semigroups
• Cutting corners
• Numerical Semigroups generated by Primes
• Translation invariant quadratic forms and dense sets of primes
• Goldbach Numbers in Short Intervals -- A Nonnegative Model Approach
• Products of primes in arithmetic progressions