Refined methods for the identifiability of tensors
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.