Recent Comments

Recent Posts
 Alef Corner: ICM2022
 The probabilistic proof that 2^400593 is a prime: a revolutionary new type of mathematical proof, or not a proof at all?
 With Avi at Suzanna
 Meeting Michael H. at Rio
 What is mathematics (or at least, how it feels)
 Alef’s Corner
 To cheer you up in difficult times 22: some mathematical news! (Part 1)
 Cheerful News in Difficult Times: The Abel Prize is Awarded to László Lovász and Avi Wigderson
 Amazing: Feng Pan and Pan Zhang Announced a Way to “Spoof” (Classically Simulate) the Google’s Quantum Supremacy Circuit!
Top Posts & Pages
 Alef Corner: ICM2022
 The probabilistic proof that 2^400593 is a prime: a revolutionary new type of mathematical proof, or not a proof at all?
 TYI 30: Expected number of Dice throws
 Cheerful News in Difficult Times: The Abel Prize is Awarded to László Lovász and Avi Wigderson
 The Argument Against Quantum Computers  A Very Short Introduction
 Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
 With Avi at Suzanna
 To cheer you up in difficult times 11: Immortal Songs by Sabine Hossenfelder and by Tom Lehrer
 To cheer you up in difficult times 22: some mathematical news! (Part 1)
RSS
Tag Archives: Roth’s theorem
A Couple Updates on the AdvancesinCombinatorics 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 MittagLeffler 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 HeathBrown, Roth's theorem, Tom Sanders
11 Comments
Around the CapSet problem (B)
Part B: Finding special cap sets This is a second part in a 3part 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 3term 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