The Grothendieck constant is strictly smaller than Krivine's bound

DOI10.1017/FMP.2013.4MaRDI QIDQ5401649zbMATH OpenOpenAlexFDO

Authors Mark Braverman, Konstantin Makarychev, Yury Makarychev, Assaf Naor

Publication date 11 March 2014

Published in Forum of Mathematics, Pi (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://arxiv.org/abs/1103.6161

zbMATH Keywords

Grothendieck constantFrieze-Kannan cut norm problemKrivine's conjecture

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Semidefinite programming (90C22) Miscellaneous inequalities involving matrices (15A45) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Tensor products in functional analysis (46M05)

Abstract: We prove that $K_G<fracpi2log(1+sqrt2)$, where $K_G$ is the Grothendieck constant.

Recommendations

• Towards computing the Grothendieck constant
• Grothendieck-type inequalities in combinatorial optimization
• Approximating the Cut-Norm via Grothendieck's Inequality
• Efficient rounding for the noncommutative Grothendieck inequality
• Efficient Rounding for the Noncommutative Grothendieck Inequality

Cites work

• scientific article; zbMATH DE number 3944534 (Why is no real title available?)
• scientific article; zbMATH DE number 2206777 (Why is no real title available?)
• A new upper bound for the complex Grothendieck constant
• A proof of the Grothendieck inequality
• Approximating the Cut-Norm via Grothendieck's Inequality
• Bell Inequalities, Grothendieck’s Constant, and Root Two
• Combinatorial Applications of Hermite Polynomials
• Constantes de Grothendieck et fonctions de type positif sur les sphères
• Gaussian kernels have only Gaussian maximizers
• Geometry and probability in Banach spaces. Notes by Paul R. Chernoff
• Grothendieck's theorem for noncommutative \(C^*\)-algebras, with an appendix on Grothendieck's constants
• Grothendieck-type inequalities in combinatorial optimization
• Grothendieck’s Theorem, past and present
• Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
• Quick approximation to matrices and applications
• The ellipsoid method and its consequences in combinatorial optimization
• The metric theory of tensor products. Grothendieck's résumé revisited

Cited in

(17)

• Nonlinear absolutely summing operators revisited
• Efficient rounding for the noncommutative Grothendieck inequality
• Grothendieck-type inequalities in combinatorial optimization
• Quasirandom Cayley graphs
• Approximating the little Grothendieck problem over the orthogonal and unitary groups
• Approximating the Cut-Norm via Grothendieck's Inequality
• Towards computing the Grothendieck constant
• On a Question of N. Th. Varopoulos and the constant $C_2(n)$
• Polynomial and multilinear Hardy-Littlewood inequalities: analytical and numerical approaches
• Grothendieck constant is norm of Strassen matrix multiplication tensor
• Random constructions in Bell inequalities: a survey
• The positive semidefinite Grothendieck problem with rank constraint
• Approximating the cut-norm via Grothendieck's inequality
• Inapproximability of Matrix \(\boldsymbol{p \rightarrow q}\) Norms
• An elementary and unified proof of Grothendieck's inequality
• Geometry of multilinear forms
• Covariate regularized community detection in sparse graphs

This page was built for publication: The Grothendieck constant is strictly smaller than Krivine's bound

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5401649)