A computer-assisted upper bound of 1.7813 for the real Grothendieck constant

We give a computer-assisted proof that the universal real Grothendieck constant satisfies $K_G^{\\mathbb R}\\le 1.7813$. The construction combines an explicit odd Hermite threshold of degree $11$ with a signed correlation polynomial of degree $51$. A sufficient inverse-majorant inequality is certified by enclosing the scalar coefficient head through degree $301$ and bounding the entire remaining tail using a weighted Gaussian trace estimate. The finite integral is bounded on a complete interval partition; its spatial exterior is controlled analytically. Exact parameters and source code that regenerate all accepted numerical inputs accompany the paper. The bound improves both the explicit bound $1.7818666069360661$ in the recent literature and the subsequently reported, system-tested value $1.7813319810625639$.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-09-16
DOI
https://doi.org/10.5281/zenodo.22800016
Primary Topic
Polynomial and algebraic computation
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
preprint

A computer-assisted upper bound of 1.7813 for the real Grothendieck constant

Bo Peng
Zenodo (CERN European Organization for Nuclear Research)
Polynomial and algebraic computation
preprint

A computer-assisted upper bound of 1.7813 for the real Grothendieck constant

Bo Peng
preprint en

Abstract

We give a computer-assisted proof that the universal real Grothendieck constant satisfies $K_G^{\mathbb R}\le 1.7813$. The construction combines an explicit odd Hermite threshold of degree $11$ with a signed correlation polynomial of degree $51$. A sufficient inverse-majorant inequality is certified by enclosing the scalar coefficient head through degree $301$ and bounding the entire remaining tail using a weighted Gaussian trace estimate. The finite integral is bounded on a complete interval partition; its spatial exterior is controlled analytically. Exact parameters and source code that regenerate all accepted numerical inputs accompany the paper. The bound improves both the explicit bound $1.7818666069360661$ in the recent literature and the subsequently reported, system-tested value $1.7813319810625639$.

Zenodo (CERN European Organization for Nuclear Research)
ShanghaiTech University (CN)
Polynomial and algebraic computation
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

A computer-assisted upper bound of 1.7813 for the real Grothendieck constant — Bo Peng · Zenodo (CERN European Organization for Nuclear Research) (2026) | TGRS Research Map | TGRS