An Upper Bound on Grothendieck's Constant

Abstract

We show that Grothendieck's real constant KG can be upper bounded by projecting vectors onto a random plane through the origin and thresholding a degree five Hermite polynomial. This resolves a conjecture of Braverman-Makarychev-Makarychev-Naor from 2011, who required an extra randomization step in their rounding scheme and proved KG<π2(1+2)-10-500. As a corollary of our result, we prove the bound KG<π2(1+2)-10-217 by thresholding degree three Hermite polynomials in the plane. We finally give a rigorous computer-assisted proof that KG<π2(1+2)-10-5 using interval arithmetic and degree three Hermite polynomial thresholding.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…