Recent Comments
-
Recent Posts
- Test Your Intuition (21): Auctions
- Oz’ Balls Problem: The Solution
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- Test your Intuition/Knowledge: What was Lord Kelvin’s Main Mistake?
- Indian Crested Porcupine
- New Ramanujan Graphs!
- Taking balls away: Oz’ Version
- Answer to test your intuition (18)
- Itai Ashlagi, Yashodhan Kanoria, and Jacob Leshno: What a Difference an Additional Man makes?
Top Posts & Pages
- Test Your Intuition (21): Auctions
- Oz' Balls Problem: The Solution
- Another Forgotten Bet: Is Don Zagier About to Owe Me 1000 Shekels For The Proof of the ABC Conjecture?
- Taking balls away: Oz' Version
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- Test Your Intuition (17): What does it Take to Win Tic-Tac-Toe
- Believing that the Earth is Round When it Matters
- Answer to test your intuition (18)
- New Ramanujan Graphs!
RSS
Tag Archives: Roth’s theorem
A Couple Updates on the Advances-in-Combinatorics Updates
In a recent post I mentioned quite a few remarkable recent developments in combinatorics. Let me mention a couple more. Independent sets in regular graphs A challenging conjecture by Noga Alon and Jeff Kahn in graph theory was about the number of … Continue reading
Posted in Combinatorics, Open problems, Updates
Tagged Independent sets in graphs, Roth's theorem
4 Comments
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
Around the Cap-Set problem (B)
Part B: Finding special cap sets This is a second part in a 3-part series about variations on the cap set problem that I studied with Roy Meshulam. (The first post is here.) I will use here a different notation than in part … Continue reading
An Open Discussion and Polls: Around Roth’s Theorem
Suppose that is a subset of of maximum cardinality not containing an arithmetic progression of length 3. Let . How does behave? We do not really know. Will it help talking about it? Can we somehow look beyond the horizon and try to guess what … Continue reading
Posted in Combinatorics, Open discussion, Open problems
Tagged Cap sets, polymath1, Roth's theorem, Szemeredi's theorem
24 Comments
Pushing Behrend Around
Erdos and Turan asked in 1936: What is the largest subset of {1,2,…,n} without a 3-term arithmetic progression? In 1946 Behrend found an example with Now, sixty years later, Michael Elkin pushed the the factor from the denominator to the enumerator, … Continue reading
Posted in Combinatorics, Updates
Tagged Arithmetic progressions, Roth's theorem, Szemeredi's theorem
10 Comments