No AI summary available for this article.
Why It Matters
Identifiability of tensor decompositions is often established through linear-algebraic conditions on the factor families.
Provenance
Discovered via ArXiv and published by ArXiv.
Key Claims
Original description
Identifiability of tensor decompositions is often established through linear-algebraic conditions on the factor families. For nonnegative decompositions, however, positivity provides additional information that is not captured by dimension and independence alone: nonnegative terms cannot cancel, and their supports constrain competing decompositions. We introduce a positive scattering term that quantifies this additional source of identifiability and combine it with the dimension budget underlying the Lovitz--Petrov generalization of Kruskal's theorem. For every subset of components, we obtain...
Discovered via ArXiv
Research papers and preprints from arXiv.
Publisher: arxiv.org
ID: http://arxiv.org/abs/2609.11606v1 · Indexed about 2 hours ago