Improving the bounds for Roth's theorem

From Polymath Wiki
Revision as of 19:16, 5 February 2011 by Gowers (Talk | contribs)

Jump to: navigation, search

This is a wiki for Polymath6, a project that aims to look at recent results of Bateman and Katz and of Sanders, and attempt to combine the ideas that go into them in order to break the log N-barrier in Roth's theorem. I hope that soon there will be expositions of their proofs, as well as of much of the background material needed to understand them. The wiki has only just been started, so has very little material on it so far.

Background material

Sketch of the Roth/Meshulam argument for cap sets

Basic facts about Bohr sets

Sketch of Bourgain's first argument using Bohr sets

Annotated bibliography

  • Michael Bateman and Nets Katz, New bounds on cap sets. The paper that obtains an improvement to the Roth/Meshulam bound for cap sets.
  • Nets Katz and Paul Koester, On additive doubling and energy, Another paper that introduced a method that Sanders used and that is related to some of the ideas in the Bateman-Katz paper as well.