arxiv
PublishedJune 5, 2026 at 4:00 AM
—neutral
Optimizing Explicit Unit-Distance Lower-Bound Certificates
Publisher summary· verbatim
arXiv:2606.03419v2 Announce Type: replace-cross Abstract: The 2026 disproof of Erd\H{o}s's unit-distance conjecture and Sawin's subsequent explicit quantitative refinement show that the maximum number $u(n)$ of unit distances among $n$ planar points can exceed $n^{1+\varepsilon}$ for a fixed positiv
Stay posted· Newsletter
A 5-min weekly brief — top movers, price watch, story of the week.
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivSFMambaNet: Spectral-Frequency Enhanced Selective State Space Model for Correspondence Pruning10harxivOptical-Guided Neural Collapse for SAR Few-Shot Class Incremental Learning10harxivDynamic Infilling Anchors for Format-Constrained Generation in Diffusion Large Language Models10harxivTemporal Order Matters for Agentic Memory: Segment Trees for Long-Horizon Agents10hThe Bubble Brief
WEEKLYRead AI insights every Tuesday — top movers, new releases, story of the week.
Originally published on arxiv ↗