Recent Comments
-
Recent Posts
- Questions and Concerns About Google’s Quantum Supremacy Claim
- Physics Related News: Israel Joining CERN, Pugwash and Global Zero, The Replication Crisis, and MAX the Damon.
- Test your intuition 52: Can you predict the ratios of ones?
- Amnon Shashua’s lecture at Reichman University: A Deep Dive into LLMs and their Future Impact.
- Mathematics (mainly combinatorics) related matters: A lot of activity.
- Alef Corner: Deep Learning 2020, 2030, 2040
- Some Problems
- Critical Times in Israel: Last Night’s Demonstrations
- An Aperiodic Monotile
Top Posts & Pages
- Questions and Concerns About Google’s Quantum Supremacy Claim
- Test your intuition 52: Can you predict the ratios of ones?
- An Aperiodic Monotile
- ICM 2022. Kevin Buzzard: The Rise of Formalism in Mathematics
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- Elchanan Mossel's Amazing Dice Paradox (your answers to TYI 30)
- About
- Physics Related News: Israel Joining CERN, Pugwash and Global Zero, The Replication Crisis, and MAX the Damon.
- Gil Bor, Luis Hernández-Lamoneda, Valentín Jiménez-Desantiago, and Luis Montejano-Peimbert: On the isometric conjecture of Banach
RSS
Tag Archives: Cap sets
Mind Boggling: Following the work of Croot, Lev, and Pach, Jordan Ellenberg settled the cap set problem!
A quote from a recent post from Jordan Ellenberg‘s blog Quomodocumque: Briefly: it seems to me that the idea of the Croot-Lev-Pach paper I posted about yesterday (GK: see also my last post) can indeed be used to give a new bound … Continue reading
Posted in Combinatorics, Open problems, Updates
Tagged Cap sets, Dion Gijswijt, Ernie Croot, Jordan Ellenberg, Peter Pach, Seva Lev.
27 Comments
Cap Sets, Sunflowers, and Matrix Multiplication
This post follows a recent paper On sunflowers and matrix multiplication by Noga Alon, Amir Spilka, and Christopher Umens (ASU11) which rely on an earlier paper Group-theoretic algorithms for matrix multiplication, by Henry Cohn, Robert Kleinberg, Balasz Szegedy, and Christopher Umans (CKSU05), … Continue reading
The Cap-Set Problem and Frankl-Rodl Theorem (C)
Update: This is a third of three posts (part I, part II) proposing some extensions of the cap set problem and some connections with the Frankl Rodl theorem. Here is a post presenting the problem on Terry Tao’s blog (March 2007). Here … Continue reading
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
30 Comments
Frankl-Rodl’s Theorem and Variations on the Cap Set Problem: A Recent Research Project with Roy Meshulam (A)
Voita Rodl I would like to tell you about a research project in progress with Roy Meshulam. (We started it in the summer, but then moved to other things; so far there are interesting insights, and perhaps problems, but not substantial … Continue reading
Posted in Combinatorics, Open problems
Tagged Cap sets, Extremal combinatorics, Intersection theorems, polymath1
11 Comments