Strong Bounds for 3-Progressions
Offered By: Simons Institute via YouTube
Course Description
Overview
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.
Syllabus
Strong Bounds for 3-Progressions
Taught by
Simons Institute
Related Courses
Graph Theory and Additive CombinatoricsMassachusetts Institute of Technology via MIT OpenCourseWare Associativity Testing - Ben Green
Institute for Advanced Study via YouTube Analysis of Boolean Functions at CMU - Additive Combinatorics
Ryan O'Donnell via YouTube The Selberg Sieve and Large Sieve - Lecture 1
International Centre for Theoretical Sciences via YouTube The Selberg Sieve - Lecture 1
International Centre for Theoretical Sciences via YouTube