### Towards Sarkozy's Problem

- Series
- Combinatorics Seminar
- Time
- Friday, April 27, 2012 - 15:05 for 1 hour (actually 50 minutes)
- Location
- Skiles 005
- Speaker
- Ernie Croot – School of Math, Ga Tech – ecroot@math.gatech.edu

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.