研究人员开发了一个开源Python流程，用于优化和验证平面几何中单位距离问题的下界证书。该流程基于Sawin对Erdős单位距离猜想的定量改进，已成功复现现有参数并产生改进的证书。最新结果表明，n个平面点之间的最大单位距离数可能超过n^1.0152，进一步的改进暗示在扩展素数范围内可达到n^1.031。 AI
影响 说明了优化启发式方法如何改进数学证书，可能对理论计算机科学产生影响。
排序理由 该集群包含一篇学术论文，详细介绍了用于优化数学证明的新计算方法。[lever_c_demoted from research: ic=2 ai=0.4]
在 arXiv cs.NE (Neural & Evolutionary) 阅读 →
AI 生成摘要 · Google Gemini · 来自 3 个来源。 我们如何撰写摘要 →
完整方法见我们的编辑标准。
The 2026 disproof of Erdős's unit-distance conjecture and Sawin's quantitative refinement show that the maximum number $u(n)$ of unit distances among $n$ planar points can exceed $n^{1+\varepsilon}$ for a fixed positive $\varepsilon$. Sawin's explicit bound gives more than $n^{1.…
The 2026 disproof of Erdős's unit-distance conjecture and Sawin's quantitative refinement show that the maximum number $u(n)$ of unit distances among $n$ planar points can exceed $n^{1+\varepsilon}$ for a fixed positive $\varepsilon$. Sawin's explicit bound gives more than $n^{1.…
The 2026 disproof of Erdős's unit-distance conjecture and Sawin's quantitative refinement show that the maximum number $u(n)$ of unit distances among $n$ planar points can exceed $n^{1+\varepsilon}$ for a fixed positive $\varepsilon$. Sawin's explicit bound gives more than $n^{1.…