Nolan Pyott, Department of Pure Mathematics, University of Waterloo
"Counting Primes using Seldberg's Sieve"
A central function in analytic number theory is the prime counting function and understanding its asymptotic behaviour has many far-reaching consequences. Though an upper bound has been known since Chebycheff, this upper bound can be confirmed using a sieving technique which proves to be stronger in this context than other sieve theory techniques. This technique can be generalized into Seldberg’s sieve which can be used to determine an upper bound on a modified prime counting function to deduce the Brun-Titchmarsh theorem.
Place: at gather.town Graduate space, the middle bottom whiteboard, link: https://app.gather.town/app/S1fgkHgk7P3dUDtw/graduate