格罗滕迪克常数新的下界与上界
New Lower and Upper Bounds for the Grothendieck Constant

原始链接: https://arxiv.org/abs/2608.11158

在本文中,Rahul Saha 等人确立了格罗滕迪克常数($K_G$)更精确的下界和上界,成功将其取值范围缩小至能够确认其十分位数字为 7 的区间。该研究定义的最新区间为: \[ \frac{6\pi}{11} \le K_G \le \frac{\pi}{2\log(1+\sqrt2)} - 10^{-4} \] 研究人员采用了创新方法以实现这一成果。下界是通过识别渐进最优 Krivine 方案的局限性而推导出的,突破了传统的基于构造的方法。在上界方面,作者首次引入了舍入方案的渐进分析,摒弃了以往仅依赖低维模型的研究路径。 值得注意的是,这一突破是人类研究人员与专业长程 AI 研究系统长期协作的成果,证明了 AI 辅助数学发现的有效性。

Hacker News 最新 | 往期 | 评论 | 提问 | 展示 | 招聘 | 提交 登录 格罗滕迪克常数(Grothendieck Constant)的上下界新研究 (arxiv.org) 5 点,由 surprisetalk 发布于 49 分钟前 | 隐藏 | 往期 | 收藏 | 1 条评论 | 帮助 lukeplato 19 分钟前 [–] 关于所使用的长视野 AI 研究系统的相关论文:https://arxiv.org/pdf/2608.11195 回复 指导方针 | 常见问题 | 列表 | API | 安全 | 法律 | 申请 YC | 联系方式 搜索:
相关文章

原文

View a PDF of the paper titled New Lower and Upper Bounds for the Grothendieck Constant, by Rahul Saha and 6 other authors

View PDF HTML (experimental)
Abstract:We establish new bounds on the Grothendieck constant $K_G$: \[
\frac{6\pi}{11}
\le
K_G
\le
\frac{\pi}{2\log(1+\sqrt2)} - 10^{-4}. \] Methodologically, our lower bound approach differs from previous works by establishing limitations on the asymptotically optimal Krivine schemes, rather than giving explicit constructions of gap instances. Our upper bound is obtained by proposing and analyzing the first asymptotic construction of rounding schemes, whereas previous works only consider low-dimensional schemes. Together, these bounds determine the previously unknown tenths digit of $K_G$ to be $7$. The bounds were discovered by a long-running collaborative effort of humans and a long-horizon AI research system that we engineered.
From: Rahul Saha [view email]
[v1] Tue, 11 Aug 2026 17:16:09 UTC (966 KB)
[v2] Wed, 12 Aug 2026 02:15:47 UTC (966 KB)
联系我们 contact @ memedata.com