New Lower and Upper Bounds for the Grothendieck Constant
Computational Complexity
2026-08-11 v1 Data Structures and Algorithms
Abstract
We establish new bounds on the Grothendieck constant : 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 to be . The bounds were discovered by a long-running collaborative effort of humans and a long-horizon AI research system that we engineered.
Keywords
Cite
@article{arxiv.2608.11158,
title = {New Lower and Upper Bounds for the Grothendieck Constant},
author = {Rahul Saha and Alan Li and Anton Xue and Swarat Chaudhuri and Adam Klivans and Pravesh K Kothari and Raghu Meka},
journal= {arXiv preprint arXiv:2608.11158},
year = {2026}
}