Recent Comments

Recent Posts
 The Trifference Problem
 Greatest Hits 20152022, Part II
 Greatest Hits 20152022, Part I
 Tel Aviv University Theory Fest is Starting Tomorrow
 Alef’s Corner
 A Nice Example Related to the Frankl Conjecture
 Amazing: Justin Gilmer gave a constant lower bound for the unionclosed sets conjecture
 Barnabás Janzer: Rotation inside convex Kakeya sets
 Inaugural address at the Hungarian Academy of Science: The Quantum Computer – A Miracle or Mirage
Top Posts & Pages
 TYI 30: Expected number of Dice throws
 Elchanan Mossel's Amazing Dice Paradox (your answers to TYI 30)
 The Trifference Problem
 Amazing: Justin Gilmer gave a constant lower bound for the unionclosed sets conjecture
 Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
 To cheer you up in difficult times 11: Immortal Songs by Sabine Hossenfelder and by Tom Lehrer
 Test your intuition 29: Diameter of various random trees
 Micha Perles' Geometric Proof of the ErdosSos Conjecture for Caterpillars
 Frankl's Conjecture for Large Families: Ilan Karpas' Proof
RSS
Tag Archives: polymath1
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
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
30 Comments
Polymath1: Success!
“polymath” based on internet image search And here is a link to the current draft of the paper. Update: March 26, the name of the post originally entitled “Polymath1: Probable Success!” was now updated to “Polymath1: Success!” It is now becoming … Continue reading
Posted in Blogging, Combinatorics, What is Mathematics
Tagged Density HalesJewett theorem, polymath1, Tim Gowers
10 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
11 Comments
Mathematics, Science, and Blogs
Michael Nielsen wrote a lovely essay entitled “Doing science online” about mathematics, science, and blogs. Michael’s primary example is a post over Terry Tao’s blog about the NavierStokes equation and he suggests blogs as a way of scaling up scientific conversation. Michael is writing … Continue reading
Posted in Blogging, What is Mathematics
Tagged Blogs, Michael Nielsen, Open science, polymath1, Tim Gowers
5 Comments