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: Irit Dinur
Good Codes papers are on the arXiv
Here are some links to the breakthrough papers about error correcting codes that I mentioned in this post. The results about locally testable codes with constant rate distance and locality was achieved independently in papers 1 and 2. 1) Locally … Continue reading
To Cheer you up in difficult times 30: Irit Dinur, Shai Evra, Ron Livne, Alex Lubotzky, and Shahar Mozes Constructed Locally Testable Codes with Constant Rate, Distance, and Locality
The Simons Institute announces an October 6, 2021 lecture by Irit Dinur with the result in the title. This is a wonderful breakthrough. I am glad to mention that I have altogether 170 combined years of friendships with the authors. … Continue reading
Posted in Combinatorics, Computer Science and Optimization
Tagged Alex Lubotzky, Irit Dinur, Ron Livne, Shahar Mozes, Shai Evra
4 Comments
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
In And Around Combinatorics: The 18th Midrasha Mathematicae. Jerusalem, JANUARY 1831
The 18th yearly school in mathematics is devoted this year to combinatorics. It will feature lecture series by Irit Dinur, Joel Hass, Peter Keevash, Alexandru Nica, Alexander Postnikov, Wojciech Samotij, and David Streurer and additional activities. As usual grants … Continue reading