Number Theory

Title: Toward a theory of prime detecting sieves
Speaker: Kevin Ford
Speaker Info: UIUC
Brief Description:
Special Note:

Given a set of integers, we wish to know how many primes there are in the set. Modern tools allow us to obtain an asymptotic for the number of primes, or at least a lower bound of the expected order, assuming certain strength Type-I information (the distribution of the sequence in progressions) and Type-II information (bilinear sums over the sequence). The methods used previously, especially Harman's sieve, are largely ad-hoc and shed little light on the limitations of the methods. In joint work with James Maynard, we develop a systematic framework for understanding the theoretical limits of these prime detecting sieves.
Date: Friday, May 03, 2024
Time: 3:00PM
Where: Lunt 103
Contact Person: Maksym Radziwill
Contact email: maksym.radziwill@gmail.com
Contact Phone:
Copyright © 1997-2024 Department of Mathematics, Northwestern University.