Recent Comments
-
Recent Posts
- To cheer you up in difficult times 21: Giles Gardam lecture and new result on Kaplansky’s conjectures
- Nostalgia corner: John Riordan’s referee report of my first paper
- At the Movies III: Picture a Scientist
- At the Movies II: Kobi Mizrahi’s short movie White Eye makes it to the Oscar’s short list.
- And the Oscar goes to: Meir Feder, Zvi Reznic, Guy Dorman, and Ron Yogev
- Thomas Vidick: What it is that we do
- To cheer you up in difficult times 20: Ben Green presents super-polynomial lower bounds for off-diagonal van der Waerden numbers W(3,k)
- To cheer you up in difficult times 19: Nati Linial and Adi Shraibman construct larger corner-free sets from better numbers-on-the-forehead protocols
- Possible future Polymath projects (2009, 2021)
Top Posts & Pages
- To Cheer You Up in Difficult Times 15: Yuansi Chen Achieved a Major Breakthrough on Bourgain's Slicing Problem and the Kannan, Lovász and Simonovits Conjecture
- To cheer you up in difficult times 21: Giles Gardam lecture and new result on Kaplansky's conjectures
- TYI 30: Expected number of Dice throws
- 8866128975287528³+(-8778405442862239)³+(-2736111468807040)³
- The Argument Against Quantum Computers - A Very Short Introduction
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- Amazing: Zhengfeng Ji, Anand Natarajan, Thomas Vidick, John Wright, and Henry Yuen proved that MIP* = RE and thus disproved Connes 1976 Embedding Conjecture, and provided a negative answer to Tsirelson's problem.
- Possible future Polymath projects (2009, 2021)
- Photonic Huge Quantum Advantage ???
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
11 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
29 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
14 Comments