Papers
Topics
Authors
Recent
Search
2000 character limit reached

Refined methods for the identifiability of tensors

Published 27 Mar 2013 in math.AG | (1303.6915v3)

Abstract: We prove that the general tensor of size 2n and rank k has a unique decomposition as the sum of decomposable tensors if k<= 0.9997 (2n)/(n+1) (the constant 1 being the optimal value). Similarly, the general tensor of size 3n and rank k has a unique decomposition as the sum of decomposable tensors if k<= 0.998 (3n)/(2n+1) (the constant 1 being the optimal value). Some results of this flavor are obtained for tensors of any size, but the explicit bounds obtained are weaker.

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.