Toward a generalization of Kruskal's theorem on tensor decomposition
Abstract
Kruskal's theorem states that a sum of product tensors constitutes a unique tensor rank decomposition if the so-called k-ranks of the product tensors are large. In this work, we propose a conjecture in which the k-rank condition of Kruskal's theorem is weakened to the standard notion of rank, and the conclusion is relaxed to a statement on the linear dependence of the product tensors. Our conjecture would imply a generalization of Kruskal's theorem. Several adaptations and generalizations of Kruskal's theorem have already been obtained, but these results still cannot certify uniqueness when the k-ranks are below a certain threshold. Our generalization would contain several of these results, and could certify uniqueness below this threshold. We prove our conjecture over an arbitrary field when the underlying multipartite vector space takes any one of three forms: or . As a corollary to the third case, we prove that if product tensors form a circuit, then they have rank greater than one in at most subsystems. This is a quadratic improvement over a recent bound obtained by Ballico, and is sharp.
Keywords
Cite
@article{arxiv.1812.00264,
title = {Toward a generalization of Kruskal's theorem on tensor decomposition},
author = {Benjamin Lovitz},
journal= {arXiv preprint arXiv:1812.00264},
year = {2020}
}
Comments
31 pages. Significant changes from v1, including: The splitting version of the main conjecture, proofs of several more special cases of the main conjecture, the observation that the main conjecture implies a generalization of Kruskal's theorem, and a proof that the inequality appearing in the main conjecture is sharp