{"title":"Failure of the trilinear operator space Grothendieck theorem","authors":"J. Briet, C. Palazuelos","doi":"10.19086/da.8805","DOIUrl":null,"url":null,"abstract":"We give a counterexample to a trilinear version of the operator space Grothendieck theorem. In particular, we show that for trilinear forms on l∞, the ratio of the symmetrized completely bounded norm and the jointly completely bounded norm is in general unbounded. The proof is based on a non-commutative version of the generalized von Neumann inequality from additive combinatorics.","PeriodicalId":37312,"journal":{"name":"Discrete Analysis","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2018-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Analysis","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.19086/da.8805","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 1
Abstract
We give a counterexample to a trilinear version of the operator space Grothendieck theorem. In particular, we show that for trilinear forms on l∞, the ratio of the symmetrized completely bounded norm and the jointly completely bounded norm is in general unbounded. The proof is based on a non-commutative version of the generalized von Neumann inequality from additive combinatorics.
期刊介绍:
Discrete Analysis is a mathematical journal that aims to publish articles that are analytical in flavour but that also have an impact on the study of discrete structures. The areas covered include (all or parts of) harmonic analysis, ergodic theory, topological dynamics, growth in groups, analytic number theory, additive combinatorics, combinatorial number theory, extremal and probabilistic combinatorics, combinatorial geometry, convexity, metric geometry, and theoretical computer science. As a rough guideline, we are looking for papers that are likely to be of genuine interest to the editors of the journal.