Papers
Topics
Authors
Recent
Search
2000 character limit reached

On generic identifiability of 3-tensors of small rank

Published 14 Mar 2011 in math.AG | (1103.2696v1)

Abstract: We introduce an inductive method for the study of the uniqueness of decompositions of tensors, by means of tensors of rank 1. The method is based on the geometric notion of weak defectivity. For three-dimensional tensors of type (a, b, c), a\le b\le c, our method proves that the decomposition is unique (i.e. k-identifiability holds) for general tensors of rank k, as soon as k\le (a+1)(b+1)/16. This improves considerably the known range for identifiability. The method applies also to tensor of higher dimension. For tensors of small size, we give a complete list of situations where identifiability does not hold. Among them, there are 4\times4\times4 tensors of rank 6, an interesting case because of its connection with the study of DNA strings.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.