PreprintarXiv licencearXiv
An Improved Lower Bound for the Complex Grothendieck Constant
Abstract
We prove KGℂ>1.35584631827168 for the classical complex Grothendieck constant, closing more than one quarter of the gap between Davie's lower bound and Haagerup's upper bound. The numerical part of the proof is rigorously verified by interval arithmetic. The lower bound and the proof were discovered by the Odin Automatic AI Research Agent.
Related
- An improved lower bound for the minimum-autocorrelation constant
- An improved lower bound for the blowup defective chromatic separation constant
- A computer-assisted upper bound of 1.7813 for the real Grothendieck constant
- Sharper Bounds for the Complex Grothendieck Constant
- Information Lower Bound for Regime Boundary Estimation — Optimal Precision Limit at the n² Scale and Universal Constant c=1/8 in the Fixed-Breakpoint Model
BibTeX
@misc{guo2026improved,
title = {{An Improved Lower Bound for the Complex Grothendieck Constant}},
author = {Shengtao Guo and Ethan X. Fang and Junwei Lu},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.07000},
eprint = {2609.07000},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.07000},
}
RIS
TY - UNPB
TI - An Improved Lower Bound for the Complex Grothendieck Constant
AU - Shengtao Guo
AU - Ethan X. Fang
AU - Junwei Lu
PY - 2026
DA - 2026/09/07
PB - arXiv
DO - 10.48550/arxiv.2609.07000
UR - https://arxiv.org/abs/2609.07000
AB - We prove K_G^ℂ>1.35584631827168 for the classical complex Grothendieck constant, closing more than one quarter of the gap between Davie's lower bound and Haagerup's upper bound. The numerical part of the proof is rigorously verified by interval arithmetic. The lower bound and the proof were discovered by the Odin Automatic AI Research Agent.
ER -