arXiv (All)
open access
Structure and Exact Certification of Nonnegative Tensor Decompositions
algebraic-geometrycombinatoricscomputational-complexitydata-structures-and-algorithmsmachine-learning
We study the structure and exact certification of nonnegative tensor decompositions supplied through rational factor matrices. Every failure of minimality or essential uniqueness contains an irreducible positive exchange between $p$ supplied terms and $q$ competing terms. A dimension count based on
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
- The Physically Admissible System Cut: When a tensor factorization is a physical subsystem: an exact and a quantitative criterion#699920
- A \(3\times 3\) counterexample to Lin and Wimmer's rank-minimization conjecture associated with Roth's similarity theorem#975173
- Record–Constraint Resolution of the Screen Problem#97643
- A class of rational trace relations closed under composition#411421
- Inequalities and Positivity in Modular Flowed Entanglement Entropy#794130
Record · ID 1448303
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