Kruskal's uniqueness inequality is sharp

DOI10.1016/j.laa.2011.05.041zbMath1267.15022OpenAlexW2008751154MaRDI QIDQ1931763

H. G. J. Derksen

Publication date: 16 January 2013

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2011.05.041

zbMATH Keywords

inequalityKruskal's theoremtensorsmulti-way arraysKruskal rank

Mathematics Subject Classification ID

Miscellaneous inequalities involving matrices (15A45) Multilinear algebra, tensor calculus (15A69) Vector spaces, linear dependence, rank, lineability (15A03)

Related Items (7)

Algebraic geometry and representation theory in the study of matrix multiplication complexity and other problems in theoretical computer science ⋮ A generalization of Kruskal’s theorem on tensor decomposition ⋮ On the description of identifiable quartics ⋮ Identifiability for a class of symmetric tensors ⋮ Embedded varieties, \(X\)-ranks and uniqueness or finiteness of the solutions ⋮ Bounds on the tensor rank ⋮ Unnamed Item

Cites Work

• On Kruskal's uniqueness condition for the Candecomp/Parafac decomposition
• Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
• A concise proof of Kruskal's theorem on tensor decomposition

This page was built for publication: Kruskal's uniqueness inequality is sharp