20. Roth's theorem III: polynomial method and arithmetic regularity

From the creator

MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019 Instructor: Yufei Zhao View the complete course: https://ocw.mit.edu/18-217F19 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP62qauV_CpT1zKaGG_Vj5igX The first half of the lecture covers a surprising recent breakthrough that gave a short polynomial method proof of Roth's theorem in the finite field setting, substantially improving previously known bounds on the problem. The second half explains another proof of Roth's theorem via the arithmetic regularity method, with consequences for popular differences. License: Creative Commons BY-NC-SA More information at https://ocw.mit.edu/terms More courses at https://ocw.mit.edu

Published 2020-05-12 · Watch on YouTube ↗
Availability and playback restrictions are controlled by the original channel.