Long progressions in sumsets

Series: 
Combinatorics Seminar
Friday, September 14, 2018 - 3:00pm
1 hour (actually 50 minutes)
Location: 
Skiles 005
,  
Georgia Tech
Organizer: 
An old question in additive number theory is determining the length of the longest progression in a sumset A+B = {a + b : a in A, b in B}, given that A and B are "large" subsets of {1,2,...,n}. I will survey some of the results on this problem, including a discussion of the methods, and also will discuss some open questions and conjectures.