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
- A sensation in the morning news - Yaroslav Shitov: Counterexamples to Hedetniemi's conjecture.
- Moshe Vardi: What is Theoretical Computer Science?
- Polynomial Bounds for Chowla's Cosine Problem
RSS
Category Archives: Geometry
Amazing: Erdős’ Unit Distance Problem was Disproved! It was achieved by AI!
Paul Erdős’s, in his 1946 paper published in the American Mathematical Monthly, posed two general questions about the distribution of distances determined by a finite set of points in a metric space. 1. Unit Distance Problem: At most how many … Continue reading
Posted in AI, Combinatorics, Geometry, Updates, What is Mathematics
Tagged OpenAI, Paul Erdos, Unit Distance Problem
35 Comments
November’s Lectures, 2025
Happy Chanukah, everybody! There is a lot of academic activity around, and the ceasefire in Gaza has brought some relief and hope. Let me tell you about the (unusually high number of) lectures I attended in November 2025, in reverse … Continue reading
Posted in AI, Combinatorics, Computer Science and Optimization, Geometry, Physics, Quantum, Updates
12 Comments
Kazhdan Seminar fall 2025 – Starting Today Oct. 19, 2026.
This semester as a part of Kazhdan Sunday seminars we will have the following two activities (see description below) 12-14 Nati Linial and Yuval Peled, “Recent advances in combinatorics” 14-16 Jake Solomon “Curve counts and quadratic forms”. Both seminars will take … Continue reading
Posted in Combinatorics, Geometry, Updates
Tagged David Kazhdan, Jake Solomon, Nati Linial, Yuval Peled
1 Comment
Amazing: Jie Ma, Wujie Shen, and Shengjie Xie Gave an Exponential Improvement for Ramsey Lower Bounds
h/t Benny Sudakov The Ramsey number R(ℓ,k) is the smallest integer n such that in any two-coloring of the edges of the complete graph on n vertices, , by red and blue, there is either a red (a complete graph … Continue reading
Posted in Combinatorics, Geometry, Probability, Updates
Tagged Jie Ma, Shengjie Xie, Wujie Shen
8 Comments
Shakhar Smorodinsky’s Solution to a Radon-Type Problem
A brief update: Since Friday June 13 Israel has been engaged in a direct war with Iran. This follows two major missiles attacks of Iran against Israel in April and October 2024, as well as Iran’s central role in the … Continue reading
Ethereum Foundation Talk and Conversation: A Critical View on Quantum Computing & A geometry day honoring Micha Sharir
Ethereum Foundation talk, today This afternoon (Tuesday, June 3, 2025) at 17:00 Israel time I give a zoom lecture on A Critical View on Quantum Computing. The lecture is hosted by the Ethereum Foundation and the 90 minute events will … Continue reading
Cosmin Pohoata and Daniel G. Zhu: Hypergraphic Zonotopes and Acyclohedra
I would like to draw your attention to the short beautiful paper Hypergraphic Zonotopes and Acyclohedra by Cosmin Pohoata and Daniel G. Zhu. The paper introduces higher-uniformity analogue of graphic zonotopes and permutohedra, and provides formulas for their volume, and, … Continue reading
Bo’az Klartag: Striking new Lower Bounds for Sphere Packing in High Dimensions
Two day ago, a new striking paper appeared on the arXiv Lattice packing of spheres in high dimensions using a stochastically evolving ellipsoid, by Bo’az Klartag. Abstract: We prove that in any dimension $latex n$ there exists an origin-symmetric ellipsoid … Continue reading
Posted in Combinatorics, Convexity, Geometry, Updates
Tagged Bo'az Klartag, Hermann Minkowski, Sphere packing
3 Comments