Can you compute the operator norm?

DOI10.1090/S0002-9939-2014-12170-8zbMath1304.43001arXiv1207.0975WikidataQ61677654 ScholiaQ61677654MaRDI QIDQ2930634

Tim Netzer, Tobias Fritz, Andreas Thom

Publication date: 19 November 2014

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

decision problemsoperator normgroup \(\mathrm{C}^*\)-algebrasRFD groups

Mathematics Subject Classification ID

Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) (L^1)-algebras on groups, semigroups, etc. (43A20)

Related Items (12)

Quantum Bilinear Optimization ⋮ Quantum logic is undecidable ⋮ On the complexity of the theory of a computably presented metric structure ⋮ Globally trace-positive noncommutative polynomials and the unbounded tracial moment problem ⋮ Elements of -algebras Attaining their Norm in a Finite-dimensional Representation ⋮ A combinatorial approach to nonlocality and contextuality ⋮ Unnamed Item ⋮ Free products with amalgamation over central 𝐶*-subalgebras ⋮ Central amalgamation of groups and the RFD property ⋮ Quadratic modules, 𝐶*-algebras, and free convexity ⋮ Vanishing of l²‐cohomology as a computational problem ⋮ The Connes embedding problem: A guided tour

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The full C*-algebra of the free group on two generators
• On non-semisplit extensions, tensor products and exactness of group \(C^*\)-algebras
• Operator-algebraic superridigity for \(\mathrm{SL}_{n}(\mathbb Z)\), \(n \geq 3\)
• Global Optimization with Polynomials and the Problem of Moments
• TSIRELSON'S PROBLEM AND KIRCHBERG'S CONJECTURE
• Convergent Relaxations of Polynomial Optimization Problems with Noncommuting Variables
• Symmetric Random Walks on Groups
• On the algorithmic insolvability of the word problem in group theory
• Non-commutative Real Algebraic Geometry - Some Basic Concepts and First Ideas
• A Representation Theorem for Archimedean Quadratic Modules on ∗-Rings
• Some two-generator one-relator non-Hopfian groups
• Computing Norms in Group C ∗ -Algebras
• Computing norms of free operators with matrix coefficients
• ABOUT THE QWEP CONJECTURE
• Quantum de finetti theorems under local measurements with applications
• On the decidability of some problems in special classes of groups
• On Computable Numbers, with an Application to the Entscheidungsproblem
• The decision problem for some classes of sentences without quantifiers
• The word problem
• Handbook of semidefinite programming. Theory, algorithms, and applications

This page was built for publication: Can you compute the operator norm?