About this Event
Speaker: Lisa Sauermann , MIT Mathematics
Title: On the cap-set problem and the slice rank polynomial method
Abstract: In 2016, Ellenberg and Gijswijt made a breakthrough on the famous cap-set problem, which asks about the maximum size of a subset of \mathbb{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.
2 people are interested in this event
zoom link: https://mit.zoom.us/j/93882149522
Also, our big wrap-up SPUR Conference will be held next Friday, August 6, where our SPUR/SPUR+ students will report on their summer's work. More details on that to follow next week...
