Tag Archives: Klaus Roth

Roth’s Theorem: Tom Sanders Reaches the Logarithmic Barrier

Posted on November 24, 2010 by Gil Kalai

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

	navid on Oz’ Balls Problem: The…
	Josué Ortega on Test Your Intuition (21):…
	Test Your Intuition… on Test Your Intuition (17): What…
	Douglas Zare on Taking balls away: Oz’…
	noah on Taking balls away: Oz’…
	ameyerowitz on Taking balls away: Oz’…
	ameyerowitz on Taking balls away: Oz’…
	Aaron on Taking balls away: Oz’…
	Gil Kalai on Answer: Lord Kelvin, The Age o…
	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 Answer: Lord Kelvin, The Age o…

Tag Archives: Klaus Roth

Roth’s Theorem: Tom Sanders Reaches the Logarithmic Barrier

Recent Comments

Recent Posts

Top Posts & Pages

RSS

Categories

Blogroll

Archives

Tags

Follow “Combinatorics and more”