跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2610.10477 · v2

Primal/Dual Method for the Grothendieck Constant

首次提交 2026-10-08 01:37
版本更新 2026-11-15 03:32
雷达观测 2026-11-17 12:06
arXiv ↗PDF ↗

摘要

We determine the hundredths digit of the real Grothendieck constant by proving 1.773≤KG≤1.77991.773 \leq K_G \leq 1.7799. Furthermore, numerical heuristics suggest the estimate KG≈1.779K_G \approx 1.779. We start by simplifying the Gaussian duality theory of KGK_G, based on Hermite projection games and Krivine rounding schemes. The bounds are obtained by a heuristic primal/dual search for these objects, followed by rigorous {\em certification} of their values. The search and certification are performed using AI tools, and in particular the rigorous certificates are very large (analytical reductions to thousands of numerical inequalities).

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

本站首次收录为 v2,暂无更早版本可对照。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v2 · 2026-11-15 03:32 · 最新观测版本

Primal/Dual Method for the Grothendieck Constant

We determine the hundredths digit of the real Grothendieck constant by proving 1.773≤KG≤1.77991.773 \leq K_G \leq 1.7799. Furthermore, numerical heuristics suggest the estimate KG≈1.779K_G \approx 1.779. We start by simplifying the Gaussian duality theory of KGK_G, based on Hermite projection games and Krivine rounding schemes. The bounds are obtained by a heuristic primal/dual search for these objects, followed by rigorous {\em certification} of their values. The search and certification are performed using AI tools, and in particular the rigorous certificates are very large (analytical reductions to thousands of numerical inequalities).

查看此版本解读 →查看此版本原文 ↗