Recent Comments

Recent Posts
 Recent progress on high dimensional TuranType problems by Andrey Kupavskii, Alexandr Polyanskii, István Tomon, and Dmitriy Zakharov and by Jason Long, Bhargav Narayanan, and Corrine Yap.
 Open problem session of HUJICOMBSEM: Problem #1, Nati Linial – Turan type theorems for simplicial complexes.
 Péter Pál Pach and Richárd Palincza: a Glimpse Beyond the Horizon
 To cheer you up 14: Hong Liu and Richard Montgomery solved the Erdős and Hajnal’s odd cycle problem
 To cheer you up in difficult times 13: Triangulating real projective spaces with subexponentially many vertices
 Benjamini and Mossel’s 2000 Account: Sensitivity of Voting Schemes to Mistakes and Manipulations
 Test Your Intuition (46): What is the Reason for Maine’s Huge Influence?
 This question from Tim Gowers will certainly cheeer you up! and test your intuition as well!
 Three games to cheer you up.
Top Posts & Pages
 TYI 30: Expected number of Dice throws
 Péter Pál Pach and Richárd Palincza: a Glimpse Beyond the Horizon
 To cheer you up in difficult times 5: A New Elementary Proof of the Prime Number Theorem by Florian K. Richter
 Recent progress on high dimensional TuranType problems by Andrey Kupavskii, Alexandr Polyanskii, István Tomon, and Dmitriy Zakharov and by Jason Long, Bhargav Narayanan, and Corrine Yap.
 This question from Tim Gowers will certainly cheeer you up! and test your intuition as well!
 Quantum computers: amazing progress (Google & IBM), and extraordinary but probably false supremacy claims (Google).
 About
 Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
 Gil's Collegial Quantum Supremacy Skepticism FAQ
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 Subash, 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