Combinatorics Seminar: Pseudorandomness in graph theory and additive combinatorics

Seminar | January 25 | 4:10-5 p.m. | 740 Evans Hall

 Yufei Zhao, University of Oxford

 Department of Mathematics

(Please note the unusual time and place of this talk.)

I will highlight some connections between graph theory and additive combinatorics. I will explain how to prove the celebrated Green-Tao theorem, that the primes contain arbitrarily long arithmetic progressions. Following a graph theoretic viewpoint, we will see an answer to the question: what kinds of pseudorandomness are used in the proof of the Green-Tao theorem?

 events@math.berkeley.edu