Recent Comments

Recent Posts
 Past and Future Events
 Joshua Hinman proved Bárány’s conjecture on face numbers of polytopes, and Lei Xue proved a lower bound conjecture by Grünbaum.
 Amazing: Jinyoung Park and Huy Tuan Pham settled the expectation threshold conjecture!
 Combinatorial Convexity: A Wonderful New Book by Imre Bárány
 Chaim EvenZohar, Tsviqa Lakrec, and Ran Tessler present: The Amplituhedron BCFW Triangulation
 Ehud Friedgut: How many cubes of 2×2×2 fit into a box of size 8×4×3? (TYI 49)
 Is HQCA Possible? A conversation with Michael Brooks
 To cheer you up in difficult times 35 combined with Test Your Intuition 48: Alef’s corner – Jazz and Math
 Reflections: On the Occasion of Ron Adin’s and Yuval Roichman’s Birthdays, and FPSAC 2021
Top Posts & Pages
 Amazing: Jinyoung Park and Huy Tuan Pham settled the expectation threshold conjecture!
 Joshua Hinman proved Bárány's conjecture on face numbers of polytopes, and Lei Xue proved a lower bound conjecture by Grünbaum.
 TYI 30: Expected number of Dice throws
 Game Theory 2021
 Greatest Hits
 Telling a Simple Polytope From its Graph
 Bálint Virág: Random matrices for Russ
 Past and Future Events
 Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
RSS
Tag Archives: Muli Safra
Kelman, Kindler, Lifshitz, Minzer, and Safra: Towards the EntropyInfluence Conjecture
Let me briefly report on a remarkable new paper by Esty Kelman, Guy Kindler, Noam Lifshitz, Dor Minzer, and Muli Safra, Revisiting BourgainKalai and Fourier Entropies. The paper describes substantial progress towards the EntropyInfluence conjecture, posed by Ehud Friedgut and … Continue reading
Posted in Combinatorics, Computer Science and Optimization, Open problems
Tagged Dor Minzer, Esty Kelman, Guy Kindler, Muli Safra, Noam Lifshitz
1 Comment
Tomorrow: Boolean functions day at the TAU theory fest
As part of the 2019/2020 TAU theory fest, tomorrow, Friday, January 3, 2020, is a Boolean function day at Tel Aviv University. The five speakers are Esty Kelman, Noam Lifschitz, Renan Gross, Ohad Klein, and Naomi Kirshner. For more (and … Continue reading
Hardness of Approximating Vertex Cover, PolytopeIntegralityGap, the AlswedeKachatrian theorem, and More.
Lior Silberman asked about applications of the 2to2 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
Subhash Khot, Dor Minzer and Muli Safra completed the proof of the 2to2 Games Conjecture
Update: A related blog post by Boaz Barak: Unique Games Conjecture – halfway there? The 2to2 Games Conjecture is a somewhat weaker form of Khot’s unique game conjecture. The paper is: Pseudorandom Sets in Grassmann Graph have NearPerfect Expansion by Subhash Khot, Dor … Continue reading
Posted in Combinatorics, Computer Science and Optimization, Updates
Tagged Dor Minzer, Muli Safra, Subhash Khot
10 Comments
New Isoperimetric Results for Testing Monotonicity
Muli, Dor and Subhash, Jerusalem May 21 2015. Michel Talagrand Gregory Margulis Property testing In this post I will tell you about a new paper by Subhash Khot, Dor Minzer and Muli Safra entitled: On … Continue reading
Posted in Combinatorics, Computer Science and Optimization
Tagged Dor Minser, Muli Safra, Subhash Khot
4 Comments