[2608.11158] New Lower and Upper Bounds for the Grothendieck Constant

Skip to main content

Search arXiv

Press Enter to search · Advanced search

-->

Computer Science > Computational Complexity

arXiv:2608.11158 (cs)

[Submitted on 11 Aug 2026 (v1), last revised 12 Aug 2026 (this version, v2)]

Title:New Lower and Upper Bounds for the Grothendieck Constant

Authors:Rahul Saha, Alan Li, Anton Xue, Swarat Chaudhuri, Adam Klivans, Pravesh K Kothari, Raghu Meka<br>View a PDF of the paper titled New Lower and Upper Bounds for the Grothendieck Constant, by Rahul Saha and 6 other authors

View PDF<br>HTML (experimental)

Abstract:We establish new bounds on the Grothendieck constant $K_G$: \[

\frac{6\pi}{11}

\le

K_G

\le

\frac{\pi}{2\log(1+\sqrt2)} - 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 $K_G$ 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.

Subjects:

Computational Complexity (cs.CC); Data Structures and Algorithms (cs.DS)

Cite as:<br>arXiv:2608.11158 [cs.CC]

(or<br>arXiv:2608.11158v2 [cs.CC] for this version)

https://doi.org/10.48550/arXiv.2608.11158

Focus to learn more

arXiv-issued DOI via DataCite

Submission history<br>From: Rahul Saha [view email]<br>[v1]<br>Tue, 11 Aug 2026 17:16:09 UTC (966 KB)

[v2]<br>Wed, 12 Aug 2026 02:15:47 UTC (966 KB)

Full-text links:<br>Access Paper:

View a PDF of the paper titled New Lower and Upper Bounds for the Grothendieck Constant, by Rahul Saha and 6 other authors<br>View PDF<br>HTML (experimental)<br>TeX Source

view license

Current browse context:

cs.CC

next >

new<br>recent<br>| 2026-08

Change to browse by:

cs<br>cs.DS

References & Citations

NASA ADS<br>Google Scholar

Semantic Scholar

export BibTeX citation<br>Loading...

BibTeX formatted citation

&times;

loading...

Data provided by:

Bookmark

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Bibliographic Explorer (What is the Explorer?)

Connected Papers Toggle

Connected Papers (What is Connected Papers?)

Litmaps Toggle

Litmaps (What is Litmaps?)

scite.ai Toggle

scite Smart Citations (What are Smart Citations?)

Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle

alphaXiv (What is alphaXiv?)

Links to Code Toggle

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub Toggle

DagsHub (What is DagsHub?)

GotitPub Toggle

Gotit.pub (What is GotitPub?)

Huggingface Toggle

Hugging Face (What is Huggingface?)

ScienceCast Toggle

ScienceCast (What is ScienceCast?)

Demos

Demos

Replicate Toggle

Replicate (What is Replicate?)

Spaces Toggle

Hugging Face Spaces (What is Spaces?)

Spaces Toggle

TXYZ.AI (What is TXYZ.AI?)

Related Papers

Recommenders and Search Tools

Link to Influence Flower

Influence Flower (What are Influence Flowers?)

Core recommender toggle

CORE Recommender (What is CORE?)

Author

Venue

Institution

Topic

About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs .

Which authors of this paper are endorsers? |<br>Disable MathJax (What is MathJax?)

Major funding support from