arXiv (All)
open access
UCP Extension in Dimension Three
We show that every UCP extension problem for a finite dimensional operator system can be reduced to three dimensions after finite matrix amplification. The set of extensions is preserved by an affine bijection. The matrix size is of order $\sqrt{d}$, where $d$ is the dimension of the original system
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Low solution rank of the matrix LASSO under RIP with consequences for rank-constrained algorithms#144202
- Optimization hierarchies for extremal geometry through complete positivity#1129459
- Matrix completion problem#955885
- Learning with tensors: a framework based on convex optimization and spectral regularization#448953
- Unique Minimizers for Permanents, Mixed Discriminants, and Log-concave Polynomials#1035053
Record · ID 1143140
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive