|COMPUTER SCIENCE/DISCRETE MATH II|
|Topic:||Arithmetic Progressions in Primes|
|Affiliation:||Member, School of Mathematics|
|Date:||Tuesday, November 24|
|Time/Room:||10:30am - 12:30pm/S-101|
I will discuss the Green-Tao proof for existence of arbitrarily long arithmetic progressions in the primes. The focus will primarily be on the parts of the proof which are related to notions in complexity theory. In particular, I will try to describe in detail how the proof can be seen as applying Szemeredi's theorem to primes, by arguing that they are indistinguishable from dense subsets of integers, for a suitable family of distinguishers.