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
Introduction to Mathematical ThinkingStanford University via Coursera Effective Thinking Through Mathematics
The University of Texas at Austin via edX Cryptography
University of Maryland, College Park via Coursera Математика для всех
Moscow Institute of Physics and Technology via Coursera Number Theory and Cryptography
University of California, San Diego via Coursera