- Reflections: On the Occasion of Ron Adin’s and Yuval Roichman’s Birthdays, and FPSAC 2021
- ICM 2018 Rio (5) Assaf Naor, Geordie Williamson and Christian Lubich
- Test your intuition 47: AGC-GTC-TGC-GTC-TGC-GAC-GATC-? what comes next in the sequence?
- Cheerful news in difficult times: Richard Stanley wins the Steele Prize for lifetime achievement!
- Combinatorial Theory is Born
- To cheer you up in difficult times 34: Ringel Circle Problem solved by James Davies, Chaya Keller, Linda Kleist, Shakhar Smorodinsky, and Bartosz Walczak
- Good Codes papers are on the arXiv
- To cheer you up in difficult times 33: Deep learning leads to progress in knot theory and on the conjecture that Kazhdan-Lusztig polynomials are combinatorial.
- The Logarithmic Minkowski Problem
Top Posts & Pages
- Navier-Stokes Fluid Computers
- The Intermediate Value Theorem Applied to Football
- TYI 30: Expected number of Dice throws
- Believing that the Earth is Round When it Matters
- To Cheer You Up in Difficult Times 31: Federico Ardila's Four Axioms for Cultivating Diversity
- Amazing: Karim Adiprasito proved the g-conjecture for spheres!
- 'Gina Says'
- To cheer you up in difficult times 27: A major recent "Lean" proof verification
- Happy Birthday Richard Stanley!
Tag Archives: Dor Minzer
To cheer you up in difficult times 3: A guest post by Noam Lifshitz on the new hypercontractivity inequality of Peter Keevash, Noam Lifshitz, Eoin Long and Dor Minzer
This is a guest post kindly contributed by Noam Lifshitz. My short introduction: There is nothing like a new hypercontractivity inequality to cheer you up in difficult times and this post describes an amazing new hypercontractivity inequality. The post describes … Continue reading
Let me briefly report on a remarkable new paper by Esty Kelman, Guy Kindler, Noam Lifshitz, Dor Minzer, and Muli Safra, Revisiting Bourgain-Kalai and Fourier Entropies. The paper describes substantial progress towards the Entropy-Influence conjecture, posed by Ehud Friedgut and … Continue reading
Let me mention two talks with very promising news by friends of the blog, Karim Adiprasito and Noam Lifshitz. As always, with the beginning of the academic year there are a lot of exciting activities, things are rather hectic around, … Continue reading
Hardness of Approximating Vertex Cover, Polytope-Integrality-Gap, the Alswede-Kachatrian theorem, and More.
Lior Silberman asked about applications of the 2-to-2 game theorem to hardness of approximation, and James Lee answered mentioning applications to vertex cover. Let me elaborate a little on vertex cover, and other matters. (Here is the pervious post on … Continue reading
Update: A related blog post by Boaz Barak: Unique Games Conjecture – halfway there? The 2-to-2 Games Conjecture is a somewhat weaker form of Khot’s unique game conjecture. The paper is: Pseudorandom Sets in Grassmann Graph have Near-Perfect Expansion by Subhash Khot, Dor … Continue reading