Recent Comments
David Román on Amazing: Erdős’ Unit Dis… David Román on Amazing: Erdős’ Unit Dis… David Román on The Ramanujan Challenge for… AI vyvrátila slavnou… on Amazing: Erdős’ Unit Dis… تحدي رامانوجان للذكا… on The Ramanujan Challenge for… mathematicalsilence on The Ramanujan Challenge for… Gil Kalai on Polymath Plus AI Vijay Vazirani on Matching in NC and Local … Gil Kalai on Matching in NC and Local … Gil Kalai on Matching in NC and Local … rohitgurjar0 on Matching in NC and Local … Vijay Vazirani on Matching in NC and Local … -
Recent Posts
- The Ramanujan Challenge for AI
- Matching in NC and Local Events
- A sensational Ramsey breakthrough by Domagoj Bradač (reblogged from Sam Mattheus’ blog)
- Three Interviews
- Amazing: Erdős’ Unit Distance Problem was Disproved! It was achieved by AI!
- Polymath Plus AI
- Starting Today: Kazhdan Sunday seminar: “Boolean Functions, Hypercontractivity, and Applications”
- Scott Aaronson’s View of my View About Quantum Computing
- The Fully Depolarizing Noise Conjecture for Physical Cat States is Twenty Years Old!
Top Posts & Pages
- The Ramanujan Challenge for AI
- Amazing: Erdős' Unit Distance Problem was Disproved! It was achieved by AI!
- About
- A sensational Ramsey breakthrough by Domagoj Bradač (reblogged from Sam Mattheus' blog)
- Attila Por's Universality Result for Tverberg Partitions
- Optimal Monotone Families for the Discrete Isoperimetric Inequality
- Moshe Vardi: What is Theoretical Computer Science?
- Polynomial Bounds for Chowla's Cosine Problem
- Matching in NC and Local Events
RSS
Monthly Archives: June 2026
Matching in NC and Local Events
Matching is in NC Matching theory is one of the richest gold mines of ideas and results in mathematics, computer science, and beyond. Recently, Abhranil Chatterjee, Sumanta Ghosh, Rohit Gurjar, Roshan Raj, and Thomas Thierauf proved that bipartite matching is … Continue reading
A sensational Ramsey breakthrough by Domagoj Bradač (reblogged from Sam Mattheus’ blog)
Gil’s comment: A great result and a beautiful blog post about it. (I thank Nati Linial and Yuval Wigderson who told me about it.) Here is a blog post about the breakthrough on computational complexity.
Three Interviews
My interview in the Israeli Academy interview series Interviewer: Alex Lubotzky Top two pictures, taken from the video. Right: my parents with my sister and me, around 1958. Left: Micha Perles carefully checking the proof of my main thesis result … Continue reading