1. A bridge between graph theory and additive combinatorics
Автор: MIT OpenCourseWare
Загружено: 2020-05-12
Просмотров: 172370
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: • MIT 18.217 Graph Theory and Additive Combi...
In an unsuccessful attempt to prove Fermat's last theorem, Schur showed that every finite coloring of the integers contains a monochromatic solution to x + y = z, an early result in Ramsey theory. Prof. Zhao begins the course with a proof of Schur's theorem via graph theory and how it led to the modern development of additive combinatorics. He then takes the class on a tour of modern highlights of the field: Roth's theorem, Szemerédi's theorem, and the Green-Tao theorem.
License: Creative Commons BY-NC-SA
More information at https://ocw.mit.edu/terms
More courses at https://ocw.mit.edu
Доступные форматы для скачивания:
Скачать видео mp4
-
Информация по загрузке:
