SPUR/RSI Lectures
Wednesday, August 04, 2021 at 2:00pm to 3:00pm
Virtual EventSpeaker: 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.
- Event Type
- Events By Interest
- Events By Audience
- Events By School
-
School of Architecture and Planning (SA+P), School of Engineering (SoE), School of Humanities, Arts, and Social Sciences (SHASS), Sloan School of Management (Sloan), School of Science, Schwarzman College of Computing
- Website
- Department
- Department of Mathematics
- Hashtag
- Contact Email
- Add to my calendar
Recent Activity
No recent activity