THE GROTHENDIECK CONSTANT IS STRICTLY SMALLER THAN KRIVINE’S BOUND
From MaRDI portal
Publication:5401649
DOI10.1017/fmp.2013.4zbMath1320.15016arXiv1103.6161OpenAlexW2175797755MaRDI QIDQ5401649
Mark Braverman, Assaf Naor, Konstantin Makarychev, Yury Makarychev
Publication date: 11 March 2014
Published in: Forum of Mathematics, Pi (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1103.6161
Semidefinite programming (90C22) Combinatorial optimization (90C27) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Miscellaneous inequalities involving matrices (15A45) Tensor products in functional analysis (46M05)
Related Items
Nonlinear absolutely summing operators revisited ⋮ Inapproximability of Matrix \(\boldsymbol{p \rightarrow q}\) Norms ⋮ Geometry of multilinear forms ⋮ On a Question of N. Th. Varopoulos and the constant $C_2(n)$ ⋮ Polynomial and multilinear Hardy-Littlewood inequalities: analytical and numerical approaches ⋮ Random constructions in Bell inequalities: a survey ⋮ Quasirandom Cayley graphs ⋮ An elementary and unified proof of Grothendieck's inequality ⋮ Covariate Regularized Community Detection in Sparse Graphs ⋮ Grothendieck constant is norm of Strassen matrix multiplication tensor
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Gaussian kernels have only Gaussian maximizers
- A new upper bound for the complex Grothendieck constant
- Quick approximation to matrices and applications
- Geometry and probability in Banach spaces. Notes by Paul R. Chernoff
- The ellipsoid method and its consequences in combinatorial optimization
- A proof of the Grothendieck inequality
- Grothendieck's theorem for noncommutative \(C^*\)-algebras, with an appendix on Grothendieck's constants
- Constantes de Grothendieck et fonctions de type positif sur les sphères
- Grothendieck-Type Inequalities in Combinatorial Optimization
- Combinatorial Applications of Hermite Polynomials
- Bell Inequalities, Grothendieck’s Constant, and Root Two
- Grothendieck’s Theorem, past and present
- Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
- Approximating the Cut-Norm via Grothendieck's Inequality