Schedule: Tuesdays at 12pm in MC5403 and Thursdays at 1pm in MC5417.
Description: Loosely speaking, sieving consists in slowly removing undesirable elements from an initial set and estimating the size of the remaining set. A common example is Erathostene’s sieve where, to count how many primes there are between 1 and N, one first removes numbers which are divisible by two, then those divisible by three, and so on.
In this seminar, we will look at the modern theory of sieve methods as presented in An Introduction to Sieve Methods and Their Applications by A. Cojocaru and R. Murty. The content expects very little background and puts a particular emphasis on applying the sieve methods directly to different number theoretic problems. We are aiming to cover chapters 4, 5, 7 and 8, but we may cover more if people are interested.
Organisers: Jérémy Champagne & Sourabh Das
Discord: Contact Jérémy (jchampag@uwaterloo.ca) if you wish to be added to the discord server for this seminar.