Recent Comments

Recent Posts
 Test your intuition 24: Which of the following three groups is trivial
 School Starts at HUJI
 A lecture by Noga
 Ehud Friedgut: Blissful ignorance and the KahnemanTversky paradox
 In And Around Combinatorics: The 18th Midrasha Mathematicae. Jerusalem, JANUARY 1831
 Mathematical Gymnastics
 Media Item from “Haaretz” Today: “For the first time ever…”
 Jim Geelen, Bert Gerards, and Geoﬀ Whittle Solved Rota’s Conjecture on Matroids
 Media items on David, Amnon, and Nathan
Top Posts & Pages
 Test your intuition 24: Which of the following three groups is trivial
 Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
 The Intermediate Value Theorem Applied to Football
 Believing that the Earth is Round When it Matters
 Polymath 8  a Success!
 The KadisonSinger Conjecture has beed Proved by Adam Marcus, Dan Spielman, and Nikhil Srivastava
 Why Quantum Computers Cannot Work: The Movie!
 Mathematical Gymnastics
 Extremal Combinatorics VI: The FranklWilson Theorem
RSS
Tag Archives: Cap sets
Cup 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 Grouptheoretic algorithms for matrix multiplication, by Henry Cohn, Robert Kleinberg, Balasz Szegedy, and Christopher Umans (CKSU05), … Continue reading
The CapSet Problem and FranklRodl 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
Posted in Combinatorics, Open problems
Tagged Cap sets, FranklRodl theorem, polymath1
Leave a comment
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
25 Comments
FranklRodl’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
6 Comments