A generalization of Kruskal’s theorem on tensor decomposition

DOI10.1017/fms.2023.20zbMath1518.14077arXiv2103.15633OpenAlexW3145796852WikidataQ122599563 ScholiaQ122599563MaRDI QIDQ6043382

Benjamin Lovitz, Fedor Petrov

Publication date: 5 May 2023

Published in: Forum of Mathematics, Sigma (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2103.15633

zbMATH Keywords

splitting theoremtensor decompositionKruskal's theorem

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Multilinear algebra, tensor calculus (15A69) Algebraic statistics (62R01) Secant varieties, tensor rank, varieties of sums of powers (14N07)

Related Items (1)

An algorithm for the non-identifiability of rank-3 tensors

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rank and optimal computation of generic tensors
• Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
• Bounds on the tensor rank
• Power sums, Gorenstein algebras, and determinantal loci. With an appendix `The Gotzmann theorems and the Hilbert scheme' by Anthony Iarrobino and Steven L. Kleiman
• Independence and port oracles for matroids, with an application to computational learning theory
• Kruskal's uniqueness inequality is sharp
• A concise proof of Kruskal's theorem on tensor decomposition
• Hilbert functions and tensor analysis
• Transformations on tensor spaces
• On the Uniqueness of the Canonical Polyadic Decomposition of Third-Order Tensors---Part I: Basic Results and Uniqueness of One Factor Matrix
• On the Uniqueness of the Canonical Polyadic Decomposition of Third-Order Tensors---Part II: Uniqueness of the Overall Decomposition
• Canonical Polyadic Decomposition of Third-Order Tensors: Reduction to Generalized Eigenvalue Decomposition
• On generic identifiability of symmetric tensors of subgeneric rank
• Characterizing operations preserving separability measures via linear preserver problems
• New Uniqueness Conditions for the Canonical Polyadic Decomposition of Third-Order Tensors
• Tensor Decomposition for Signal Processing and Machine Learning
• On decomposable correlation matrices
• Multi-partite separable states with unique decompositions and construction of three qubit entanglement with positive partial transpose
• Coupled Canonical Polyadic Decompositions and (Coupled) Decompositions in Multilinear Rank-$(L_r,n,L_r,n,1)$ Terms---Part I: Uniqueness
• Effective Criteria for Specific Identifiability of Tensors and Forms

This page was built for publication: A generalization of Kruskal’s theorem on tensor decomposition