Recent Comments

Recent Posts
 Questions and Concerns About Google’s Quantum Supremacy Claim
 Physics Related News: Israel Joining CERN, Pugwash and Global Zero, The Replication Crisis, and MAX the Damon.
 Test your intuition 52: Can you predict the ratios of ones?
 Amnon Shashua’s lecture at Reichman University: A Deep Dive into LLMs and their Future Impact.
 Mathematics (mainly combinatorics) related matters: A lot of activity.
 Alef Corner: Deep Learning 2020, 2030, 2040
 Some Problems
 Critical Times in Israel: Last Night’s Demonstrations
 An Aperiodic Monotile
Top Posts & Pages
 Questions and Concerns About Google’s Quantum Supremacy Claim
 An Aperiodic Monotile
 Test your intuition 52: Can you predict the ratios of ones?
 A Mysterious Duality Relation for 4dimensional Polytopes.
 TYI 30: Expected number of Dice throws
 Quantum Computers: A Brief Assessment of Progress in the Past Decade
 The Simplex, the Cyclic polytope, the Positroidron, the Amplituhedron, and Beyond
 A Nice Example Related to the Frankl Conjecture
 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
5 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