Number Theory

Title: Understanding sieve via additive combinatorics
Speaker: Xuancheng Shao
Speaker Info: University of Oxford
Brief Description:
Special Note:

Many of the most interesting problems in number theory can be phrased under the general framework of sieve problems. For example, the ancient sieve of Eratosthenes is an algorithm to produce primes up to a given threshold. Sieve problems are in general very difficult, and a class of clever techniques have been discovered in the last 100 years to yield stronger and stronger results. In this talk I will discuss the significance of understanding general sieve problems, and present a novel approach to study them via additive combinatorics. This is joint work with Kaisa Matomaki.
Date: Friday, January 13, 2017
Time: 3:00PM
Where: Lunt 105
Contact Person: Laura DeMarco
Contact email: demarco@northwestern.edu
Contact Phone:
Copyright © 1997-2024 Department of Mathematics, Northwestern University.