Noncommutative nullstellensätze and perfect games
From MaRDI portal
Publication:6158478
DOI10.1007/s00023-022-01262-1arXiv2111.14928MaRDI QIDQ6158478
Igor Klep, Adam Bene Watts, J. William Helton
Publication date: 20 June 2023
Published in: Annales Henri Poincaré (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2111.14928
Game theory (91Axx) Selfadjoint operator algebras ((C^*)-algebras, von Neumann ((W^*)-) algebras, etc.) (46Lxx) Foundations, quantum information and its processing, quantum axioms, and philosophy (81Pxx)
Related Items
New directions in real algebraic geometry. Abstracts from the workshop held March 19--24, 2023 ⋮ A Characterization of Perfect Strategies for Mirror Games
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On real one-sided ideals in a free algebra
- Multiplicative bases, Gröbner bases, and right Gröbner bases
- Algebras, synchronous games, and chromatic numbers of graphs
- Unbounded induced representations of \(\ast \)-algebras
- Perfect strategies for non-local games
- Computing sum of squares decompositions with rational coefficients
- Connes' embedding conjecture and sums of Hermitian squares
- Optimization of Polynomials in Non-Commuting Variables
- TSIRELSON'S PROBLEM AND KIRCHBERG'S CONJECTURE
- The truncated tracial moment problem
- Perfect commuting-operator strategies for linear system games
- Rational sums of hermitian squares of free noncommutative polynomials
- A synchronous game for binary constraint systems
- A positivstellensatz for non-commutative polynomials
- A noncommutative real nullstellensatz corresponds to a noncommutative real ideal: Algorithms
- Tsirelson’s problem and an embedding theorem for groups arising from non-local games
- Ideals, Varieties, and Algorithms
- Connes' embedding problem and Tsirelson's problem
- Synchronous linear constraint system games
- Estimating quantum chromatic numbers
- Constrained trace-optimization of polynomials in freely noncommuting variables
- 3XOR games with perfect commuting operator strategies have perfect tensor product strategies and are decidable in polynomial time
