Tomasz Schoen: Improved bound in Roth’s theorem

22nd May, 2020
Watch Later Cinema Mode

I sketch a proof of a new bound in Roth’s theorem on arithmetic progressions: if A ⊆ {1,…,N} does not contain any non-trivial three-term arithmetic progression then |A| ≪ (log log N)^3+o(1)N/log N.

This video is part of the Webinar in Additive Combinatorics series, and this is their YouTube channel.