Strong Bounds for 3-Progressions

Remote video URL

The Simons Institute’s Breakthroughs lecture series highlights major research advances in theoretical computer science, as they happen. This spring, Raghu Meka presented joint work with Zander Kelley on one of the most important open problems in additive combinatorics. 

 

,