Recent Comments

Recent Posts
 Problems for Imre Bárány’s Birthday!
 Twelves short videos about members of the Department of Mathematics and Statistics at the University of Victoria
 Jozsef Solymosi is Giving the 2017 Erdős Lectures in Discrete Mathematics and Theoretical Computer Science
 Updates (belated) Between New Haven, Jerusalem, and TelAviv
 Oded Goldreich Fest
 The Race to Quantum Technologies and Quantum Computers (Useful Links)
 Around the GarsiaStanley’s Partitioning Conjecture
 My Answer to TYI 28
 Test your intuition 28: What is the most striking common feature to all these remarkable individuals
Top Posts & Pages
 Problems for Imre Bárány's Birthday!
 A Breakthrough by Maryna Viazovska Leading to the Long Awaited Solutions for the Densest Packing Problem in Dimensions 8 and 24
 Believing that the Earth is Round When it Matters
 Rodica Simion: Immigrant Complex
 When It Rains It Pours
 Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
 Polymath 10 Emergency Post 5: The ErdosSzemeredi Sunflower Conjecture is Now Proven.
 Extremal Combinatorics III: Some Basic Theorems
 Twelves short videos about members of the Department of Mathematics and Statistics at the University of Victoria
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 CrootLevPach 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.
20 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 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
26 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
7 Comments