Open Neighborhood Seminar: On the cap-set problem and the slice rank polynomial method

SEMINARS, OPEN NEIGHBORHOOD

View Calendar
October 12, 2022 4:30 pm - 5:30 pm
Science Center 507
Address: 1 Oxford Street, Cambridge, MA 02138 USA
Speaker:

Lisa Sauermann - MIT

In 2016, Ellenberg and Gijswijt made a breakthrough on the famous cap-set problem, which asks about the maximum size of a subset of (F_3)^n not containing a three-term arithmetic progression. They proved that any such set has size at most 2.756^n. Their proof was later reformulated by Tao, introducing what is now called the slice rank polynomial method. This talk will explain Tao's proof of the Ellenberg-Gijswijt bound for the cap-set problem, and discuss some related problems.