We prove that the general tensor of size 2^n and rank k has a unique decomposition as the sum of decomposable tensors if k< 0.9997*2^n/(n+1) (the constant 1 being the optimal value). Similarly, the general tensor of size 3^n and rank k has a unique decomposition as the sum of decomposable tensors if k< 0.998*3^n/(2n+1) (the constant 1 being the optimal value)
We give a robust version of the celebrated result of Kruskal on the uniqueness of tensor decompo-sit...
We prove that a general tensor of rank 8 in C^3 x C^6 x C^6 has at least 6 decompositions as sum o...
The tensor rank decomposition problem consists of recovering the unique parameters of the decomposit...
We prove that the general tensor of size 2^n and rank k has a unique decomposition as the sum of dec...
We prove that the general tensor of size 2^n and rank k has a unique decomposition as the sum of dec...
We introduce an inductive method for the study of the uniqueness of decompositions of tensors, by me...
We introduce an inductive method for the study of the uniqueness of decompositions of tensors, by me...
We introduce an inductive method for the study of the uniqueness of decompositions of tensors, by me...
We propose a new sufficient condition for verifying whether general rank-r complex tensors of arbitr...
We propose a new sufficient condition for verifying whether generic rank-r complex tensors of arbitr...
We propose a new sufficient condition for verifying whether generic rank-r complex tensors of arbitr...
In applications where the tensor rank decomposition arises, one often relies on its identifiability ...
In applications where the tensor rank decomposition arises, one often relies on its identifiability ...
In applications where the tensor rank decomposition arises, one often relies on its identifiability ...
In applications where the tensor rank decomposition arises, one often relies on its identifiability ...
We give a robust version of the celebrated result of Kruskal on the uniqueness of tensor decompo-sit...
We prove that a general tensor of rank 8 in C^3 x C^6 x C^6 has at least 6 decompositions as sum o...
The tensor rank decomposition problem consists of recovering the unique parameters of the decomposit...
We prove that the general tensor of size 2^n and rank k has a unique decomposition as the sum of dec...
We prove that the general tensor of size 2^n and rank k has a unique decomposition as the sum of dec...
We introduce an inductive method for the study of the uniqueness of decompositions of tensors, by me...
We introduce an inductive method for the study of the uniqueness of decompositions of tensors, by me...
We introduce an inductive method for the study of the uniqueness of decompositions of tensors, by me...
We propose a new sufficient condition for verifying whether general rank-r complex tensors of arbitr...
We propose a new sufficient condition for verifying whether generic rank-r complex tensors of arbitr...
We propose a new sufficient condition for verifying whether generic rank-r complex tensors of arbitr...
In applications where the tensor rank decomposition arises, one often relies on its identifiability ...
In applications where the tensor rank decomposition arises, one often relies on its identifiability ...
In applications where the tensor rank decomposition arises, one often relies on its identifiability ...
In applications where the tensor rank decomposition arises, one often relies on its identifiability ...
We give a robust version of the celebrated result of Kruskal on the uniqueness of tensor decompo-sit...
We prove that a general tensor of rank 8 in C^3 x C^6 x C^6 has at least 6 decompositions as sum o...
The tensor rank decomposition problem consists of recovering the unique parameters of the decomposit...
DOI
Add to ORKG