Improving the bounds for Roth's theorem: Difference between revisions
From Polymath Wiki
Jump to navigationJump to search
Added links to Bateman-Katz and Sanders |
→Links to more informal discussions of the problem: identified research and discussion threads |
||
| (9 intermediate revisions by 2 users not shown) | |||
| Line 1: | Line 1: | ||
This is | 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]] | |||
==The Bateman-Katz argument== | |||
[[Overview]] | |||
[[BK:Section 3|Section 3: the "nd-estimate"]] | |||
[[BK:Section 4|Section 4: the large spectrum contains many additive quadruples]] | |||
[[BK:Section 5|Section 5: the large spectrum of a non-incrementing set is not additively smoothing]] | |||
[[BK:Section 6|Section 6: the structure of additively non-smoothing sets]] | |||
[[BK:Section 7|Section 7: the structure of the large spectrum of a non-incrementing cap set]] | |||
[[BK:Section 8|Section 8: using the structure of the large spectrum to obtain density increments]] | |||
==Sanders's argument== | |||
[[Overview]] | |||
[[The Croot-Sisask lemma]] | |||
[[The Katz-Koester lemma]] | |||
[[Sanders's local version of Chang's theorem]] | |||
==Annotated bibliography== | ==Annotated bibliography== | ||
| Line 7: | Line 40: | ||
*Tom Sanders, [http://arxiv.org/abs/1011.0104 On Roth's theorem on progressions]. The paper that gets within loglog factors of the 1/logN density barrier in Roth's theorem. | *Tom Sanders, [http://arxiv.org/abs/1011.0104 On Roth's theorem on progressions]. The paper that gets within loglog factors of the 1/logN density barrier in Roth's theorem. | ||
*Ernie Croot and Olof Sisask, [http://arxiv.org/abs/1003.2978 A probabilistic technique for finding almost-periods of convolutions]. The paper that introduced a technique that is central to Sanders's proof. | |||
*Nets Katz and Paul Koester, [http://arxiv.org/abs/0802.4371 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. | |||
==Links to more informal discussions of the problem== | |||
*[http://polymathprojects.org/2011/02/05/polymath6-improving-the-bounds-for-roths-theorem/ Blog post by Tom Sanders about the ideas and difficulties involved] (Main research thread) | |||
*[http://gowers.wordpress.com/2011/02/05/polymath6-a-is-to-b-as-c-is-to/ Polymath6: A is to B as C is to ???] (Main discussion thread) | |||
*[http://polymathprojects.files.wordpress.com/2011/02/polymath-3.pdf The way an argument might go], A document written by Nets Katz, summarizing discussions he had with Olof Sisask about the possibilities for combining the Bateman-Katz and Sanders papers. | |||
Latest revision as of 04:28, 12 February 2011
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
Sketch of Bourgain's first argument using Bohr sets
The Bateman-Katz argument
Section 4: the large spectrum contains many additive quadruples
Section 5: the large spectrum of a non-incrementing set is not additively smoothing
Section 6: the structure of additively non-smoothing sets
Section 7: the structure of the large spectrum of a non-incrementing cap set
Section 8: using the structure of the large spectrum to obtain density increments
Sanders's argument
Sanders's local version of Chang's theorem
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.
- Tom Sanders, On Roth's theorem on progressions. The paper that gets within loglog factors of the 1/logN density barrier in Roth's theorem.
- Ernie Croot and Olof Sisask, A probabilistic technique for finding almost-periods of convolutions. The paper that introduced a technique that is central to Sanders's proof.
- 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.
Links to more informal discussions of the problem
- Blog post by Tom Sanders about the ideas and difficulties involved (Main research thread)
- Polymath6: A is to B as C is to ??? (Main discussion thread)
- The way an argument might go, A document written by Nets Katz, summarizing discussions he had with Olof Sisask about the possibilities for combining the Bateman-Katz and Sanders papers.
