Long Arithmetic Progressions in Sumsets
Speaker: Endre Szemeredi, Hungarian Academy of Sciences
Location: Warren Weaver Hall 1302
Date: Monday, December 13, 2010, 3:45 p.m.
We are going to give exact bound for the size of longest arithmetic progression in sumset sums. In addition, we describe the structure of the subset sums, and give applications in number theory and probability theory. (This part is partially joint work with Van Vu.)