Vinogradov's Theorem for primes with missing digits

Abstract: In the 1930s, Vinogradov showed that all sufficiently large odd numbers can be written as the sum of three primes. In 2015, Maynard showed that g is a large enough base and b is a digit, then there are infinitely many primes whose base g expansion doesn't contain the digit b. In this talk, we will discuss a synthesis of their results: that every sufficiently large odd number can be written as the sum of three primes whose base g expansion doesn't contain the digit b. The proof of this result is naturally a combination of the techniques of Vinogradov and Maynard, and we will discuss the crucial ingredients present in these works, and how it can be adapted to our problem. This is joint work with Mehtaab Sawhney.

analysis of PDEsclassical analysis and ODEs

Audience: researchers in the topic

UCLA analysis and PDE seminar

Series comments: Description: Research seminar in analysis & PDE