James Maynard, Oxford/Centre de Recherches Mathematiques
“Small gaps between primes”
We will introduce a refinement of the ‘GPY sieve method’ for studying small gaps between primes. This refinement will allow us to show that lim infn?(pn+m?pn) < ∞ for any integer m, and so there are infinitely many bounded length intervals containing m primes. Moreover, this method also applies to any subset of the primes which are reasonably well-distributed in arithmetic progressions. We will also discuss more recent developments from the Polymath project which improve the numerical bounds on lim infn(pn+1?pn).
Please note day, room and time!
Refreshments will be served in MC 5046 at 3:30 p.m. Everyone is welcome to attend.