Department of Mathematics


  •  Understanding sieve via additive combinatorics
  •  01/11/2017
  •  4:10 PM - 5:00 PM
  •  C304 Wells Hall
  •  Xuancheng Fernando Shao, Oxford

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.



Department of Mathematics
Michigan State University
619 Red Cedar Road
C212 Wells Hall
East Lansing, MI 48824

Phone: (517) 353-0844
Fax: (517) 432-1562

College of Natural Science