Explore a lecture on the mathematical problem of finding three equally spaced numbers in large sets of integers. Delve into the history of this cornerstone problem in additive combinatorics, from Roth's 1953 proof to Behrend's 1946 construction. Examine the recent breakthrough by Bloom and Sisask in 2020, and discover new research that pushes the bounds closer to Behrend's construction. Learn about the implications of this work for understanding the structure of large sets of integers and its connections to other areas of mathematics.
Overview
Syllabus
Strong Bounds for 3-Progressions
Taught by
Simons Institute
Related Courses
-
Basic Lower Bounds and Kneser's Theorem by David Grynkiewicz
-
Additive Number Theory - Extremal Problems and the Combinatorics of Sumsets by M. Nathanson
-
Quantitative Bounds in the Polynomial Szemerédi Theorem and Related Results
-
A Reverse Minkowski Theorem in Lattice Theory and Geometry
-
The Sharp Threshold for Making Squares
-
New Frontiers in Structure vs Randomness with Applications to Combinatorics, Complexity, and Algorithms
