New Lower and Upper Bounds for the Grothendieck Constant
Rahul Saha, Alan Li, Anton Xue, Swarat Chaudhuri, Adam Klivans, Pravesh K Kothari, Raghu Meka
Abstract
We establish new bounds on the Grothendieck constant KG: \[ 6π11 KG π2(1+2) - 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 KG 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.
Create a lesson
Related papers
A Structural Proof of the Lower Bound 21 for 3×3 Matrix Multiplication over F2
Shuxing Yang, Rui Zhao, Junyao Wu et al.
An Operator Approach to Register Programs for Catalytic Computing
Antoine Vinciguerra
Rational Reductions and Regular Languages of Constant Circuit Complexity
Stefan Göller, Amaldev Manuel
Hidden Circuits and Exact Counting in Ordered Graphs
Chenghua Liu, Boning Meng
Improved lower bounds for decomposable randomized encoding
Justin Holmgren, Kewen Wu
Separating Non-redundancy and Chain Length
Joshua Brakensiek, Venkatesan Guruswami, Aaron Putterman