Difference between revisions of "Improving the bounds for Roth's theorem"
(Started page in very preliminary form)
Revision as of 11:16, 5 February 2011
This is a holding page for 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.