From Asymptotic Geometry of Tori to Boundary Rigidity: A Survey

On 3-Term Arithmatic Progressions - Why is it so difficult?

Endre Szemeredi
Rutgers University


We are going to discuss an innocent looking combinatorial problem. Is it true that a dense set of integers always contains a 3-term arithmatic progression. We compare the strengths of the elementary and analytic techniques.

**Please note that there will be a wine and cheese reception after the colloquium to celebrate Prof Szemeredi's recent Steele Prize

This page was last updated on February 25, 2008 at 05:03 pm and is maintained by webmaster@math.rutgers.edu.
For questions regarding courses and/or special permission, please contact mclausen@math.rutgers.edu.
For questions or comments about this site, please contact help@math.rutgers.edu.
© 2012 Rutgers, The State University of New Jersey. All rights reserved.