The Grothendieck constant is strictly smaller than Krivine's bound

Abstract

We prove that $K_G<\frac{\pi }{2\log (1+\sqrt{2})}$, where $K_G$ is the Grothendieck constant.

An extended abstract describing the contents of this work will appear in FOCS 2011. Suggestions of the FOCS reviewers have been addressed

Cited by in corpus (9)

• Grothendieck inequalities for semidefinite programs with rank constraint
• A PTAS for the Classical Ising Spin Glass Problem on the Chimera Graph Structure
• Learning Communities in the Presence of Errors
• Absolutely summing operators revisited: new directions in the nonlinear theory
• Hardness and Approximation Results for $L_p$-Ball Constrained Homogeneous Polynomial Optimization Problems
• Errata and Addenda to Mathematical Constants
• From Parseval to Grothendieck and a little beyond, part I
• Estimates for the asymptotic behavior of the constants in the Bohnenblust--Hille inequality
• Krivine schemes are optimal