The Grothendieck constant is strictly smaller than Krivine's bound

DOI10.1017/FMP.2013.4zbMATH Open1320.15016arXiv1103.6161OpenAlexW2175797755MaRDI QIDQ5401649FDOQ5401649

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)

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

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

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

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)

Cites Work

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

Cited In (17)

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

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)