Recent Comments
Reshef on Why is mathematics possib… Reshef on Why is mathematics possib… gowers on Why is mathematics possib… Peter Shor on A Few Slides and a Few Comment… Gil Kalai on A Few Slides and a Few Comment… Peter W. Shor on A Few Slides and a Few Comment… Peter W. Shor on A Few Slides and a Few Comment… Peter W. Shor on A Few Slides and a Few Comment… Gil Kalai on A Few Slides and a Few Comment… Peter W. Shor on A Few Slides and a Few Comment… Gil Kalai on A Few Slides and a Few Comment… Peter W. Shor on A Few Slides and a Few Comment…
Tag Archives: Roger Heath-Brown
Roth’s Theorem: Tom Sanders Reaches the Logarithmic Barrier
Click here for the most recent polymath3 research thread. I missed Tom by a few minutes at Mittag-Leffler Institute a year and a half ago Suppose that is a subset of of maximum cardinality not containing an arithmetic progression of length 3. Let . … Continue reading
Posted in Combinatorics, Open problems
Tagged Endre Szemeredi, Jean Bourgain, Klaus Roth, Roger Heath-Brown, Roth's theorem, Tom Sanders
9 Comments
