Research Horizons Seminar
Tuesday, February 9, 2010 - 12:00
1 hour (actually 50 minutes)
Hosted by: Huy Huynh and Yao Li
Olof Sisask and myself have produced a new probabilistic technique for finding `almost periods' of convolutions of subsets of finite groups. In this talk I will explain how this has allowed us to give (just recently) new bounds on the length of the longest arithmetic progression in a sumset A+A.