16:00
Optimality of sieves
Abstract
The closest thing we have to a general method for finding primes in sets is to use sieve methods to turn the problem into some other (hopefully easier) arithmetic questions about the set.
Unfortunately this process is still poorly understood - we don’t know ‘how much’ arithmetic information is sufficient to guarantee the existence of primes, and how much is not sufficient. Often arguments are rather ad-hoc.
I’ll talk about work-in-progress with Kevin Ford which shows that many of our common techniques are not optimal and can be refined, and in many cases these new refinements are provably optimal.