- Proof By Lice!
- The seventeen camels riddle, and Noga Alon’s camel proof and algorithms
- Edmund Landau and the Early Days of the Hebrew University of Jerusalem
- Boolean Functions: Influence, Threshold, and Noise
- Laci Babai Visits Israel!
- Polymath10 conclusion
- Is Heads-Up Poker in P?
- The Median Game
- International mathematics graduate studies at the Hebrew University of Jerusalem
Top Posts & Pages
- The seventeen camels riddle, and Noga Alon's camel proof and algorithms
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- Proof By Lice!
- Polymath10: The Erdos Rado Delta System Conjecture
- A Breakthrough by Maryna Viazovska Leading to the Long Awaited Solutions for the Densest Packing Problem in Dimensions 8 and 24
- Updates and plans III.
- Extremal Combinatorics III: Some Basic Theorems
- Mind Boggling: Following the work of Croot, Lev, and Pach, Jordan Ellenberg settled the cap set problem!
- When It Rains It Pours
Tag Archives: Roth’s theorem
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
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
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
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