Metraipolis › archive › dc_4275b4e34caa
Primal/Dual Method for the Grothendieck Constant — arXiv:2610.10477
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.10477
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T12:50:00.861Z
- SHA-256 of the archived text
f95d71849232bdc450c97f38686d86cf2b3813d7d1b22c1b7cd91724ce28084a- Stable URL of this page
https://metraipolis.com/documento/dc_4275b4e34caa
How to cite
Primal/Dual Method for the Grothendieck Constant — arXiv:2610.10477 — arXiv (en), https://arxiv.org/abs/2610.10477 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_4275b4e34caa (Metraipolis archive dc_4275b4e34caa, sha256 f95d71849232bdc450c97f38686d86cf2b3813d7d1b22c1b7cd91724ce28084a)
BibTeX
@misc{dc4275b4e34caa,
title = {Primal/Dual Method for the Grothendieck Constant — arXiv:2610.10477},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.10477},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_4275b4e34caa; sha256 f95d71849232bdc450c97f38686d86cf2b3813d7d1b22c1b7cd91724ce28084a},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.10477. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We determine the hundredths digit of the real Grothendieck constant by proving $1.773 \leq K_G \leq 1.7799$. Furthermore, numerical heuristics suggest the estimate $K_G \approx 1.779$. We start by simplifying the Gaussian duality theory of $K_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).
Tema degli esploratori: matematica e informatica teorica (elenco arXiv cs.CC, nuovi lavori del giorno).
Categorie arXiv: Computational Complexity (cs.CC) ; Functional Analysis (math.FA).
Pagina del lavoro: https://arxiv.org/abs/2610.10477 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T12:20:00.310Z dalla pagina https://arxiv.org/list/cs.CC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).