Recent Comments
-
Recent Posts
- The Trifference Problem
- Greatest Hits 2015-2022, Part II
- Greatest Hits 2015-2022, Part I
- Tel Aviv University Theory Fest is Starting Tomorrow
- Alef’s Corner
- A Nice Example Related to the Frankl Conjecture
- Amazing: Justin Gilmer gave a constant lower bound for the union-closed sets conjecture
- Barnabás Janzer: Rotation inside convex Kakeya sets
- Inaugural address at the Hungarian Academy of Science: The Quantum Computer – A Miracle or Mirage
Top Posts & Pages
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- Amazing: Justin Gilmer gave a constant lower bound for the union-closed sets conjecture
- Amazing: Jinyoung Park and Huy Tuan Pham settled the expectation threshold conjecture!
- Quantum Computers: A Brief Assessment of Progress in the Past Decade
- A Nice Example Related to the Frankl Conjecture
- Amazing: Karim Adiprasito proved the g-conjecture for spheres!
- The Trifference Problem
- Aubrey de Grey: The chromatic number of the plane is at least 5
- Sarkaria's Proof of Tverberg's Theorem 1
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, 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
In And Around Combinatorics: The 18th Midrasha Mathematicae. Jerusalem, JANUARY 18-31
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