Towards Sarkozy's Problem

Combinatorics Seminar
Friday, April 27, 2012 - 15:05
1 hour (actually 50 minutes)
Skiles 005
School of Math, Ga Tech
Sarkozy's problem is a classical problem in additive number theory, which asks for the size of the largest subset A of {1,2,...,n} such that the difference set A-A does not contain a (non-zero) square. I will discuss the history of this problem, some recent progress that I and several collaborators have made on it, and our future research plans.