2016
Dec
29

# Colloquium: Jordan Ellenberg (University of Wisconsin) "The cap set problem"

2:30pm to 3:30pm

## Location:

Manchester Building (Hall 2), Hebrew University Jerusalem

A very old question in additive number theory is: how large can a subset of Z/NZ be which contains no three-term arithmetic progression? An only slightly younger problem is: how large can a subset of (Z/3Z)^n be which contains no three-term arithmetic progression? The second problem was essentially solved in 2016, by the combined work of a large group of researchers around the world, touched off by a brilliantly simple new idea of Croot, Lev, and Pach.