Prime-Detecting Sieves (series unlisted)

Abstract: The first step in the proof of Maynard's main theorem in "Primes in Arithmetic Progression to Large Moduli: I" is a sieve decomposition of the primes. This is accomplished via Harman's sieve, though Maynard remarks that the Heath-Brown identity would serve a similar purpose. This talk discusses Harman's sieve, other combinatorial descriptions of the primes, and the material of §7 of Maynard's paper.

number theory

Audience: researchers in the topic

London ANT Study Group