We prove a criterion for the identifiability of symmetric tensors P of type 3x...x3 (d times), whose rank k is bounded by (d^2+2d)/8. The criterion is based on the study of the Hilbert function of a set of points P_1,..., P_k which computes the rank of the tensor P
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...
A tensor T, in a given tensor space, is said to be h-identifiable if it admits a unique decompositio...
We prove a criterion for the identifiability of symmetric tensors P of type 3x...x3 (d times), whose...
We prove a criterion for the identifiability of symmetric tensors P of type 3x...x3 (d times), whose...
AbstractWe prove a criterion for the identifiability of symmetric tensors P of type 3×⋯×3, d times, ...
AbstractWe prove a criterion for the identifiability of symmetric tensors P of type 3×⋯×3, d times, ...
We use methods of algebraic geometry to find new, effective methods for detecting the identifiabili...
We use methods of algebraic geometry to find new, effective methods for detecting the identifiabili...
We use methods of algebraic geometry to find new, effective methods for detecting the identifiabili...
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 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...
A tensor T, in a given tensor space, is said to be h-identifiable if it admits a unique decompositio...
We prove a criterion for the identifiability of symmetric tensors P of type 3x...x3 (d times), whose...
We prove a criterion for the identifiability of symmetric tensors P of type 3x...x3 (d times), whose...
AbstractWe prove a criterion for the identifiability of symmetric tensors P of type 3×⋯×3, d times, ...
AbstractWe prove a criterion for the identifiability of symmetric tensors P of type 3×⋯×3, d times, ...
We use methods of algebraic geometry to find new, effective methods for detecting the identifiabili...
We use methods of algebraic geometry to find new, effective methods for detecting the identifiabili...
We use methods of algebraic geometry to find new, effective methods for detecting the identifiabili...
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 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...
A tensor T, in a given tensor space, is said to be h-identifiable if it admits a unique decompositio...
DOI
Add to ORKG