Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
133 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Refined methods for the identifiability of tensors (1303.6915v3)

Published 27 Mar 2013 in math.AG

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

We haven't generated a summary for this paper yet.