Strong Bounds for 3-Progressions

Strong Bounds for 3-Progressions

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.