We use methods of algebraic geometry to find new, effective methods for detecting the identifiability of symmetric tensors. In particular, for ternary symmetric tensors T of degree 7, we use the analysis of the Hilbert function of a finite projective set, and the Cayley–Bacharach property, to prove that, when the Kruskal’s ranks of a decomposition of T are maximal (a condition which holds outside a Zariski closed set of measure 0), then the tensor T is identifiable, i.e., the decomposition is unique, even if the rank lies beyond the range of application of both the Kruskal’s and the reshaped Kruskal’s criteria
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...
In applications where the tensor rank decomposition arises, one often relies on its identifiability ...
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...
© 2018 European Mathematical Society Publishing House. All rights reserved. We show how methods of a...
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 show how methods of algebraic geometry can produce criteria for the identifiability of specific ...
We show how methods of algebraic geometry can produce criteria for the identifiability of specific ...
We show how methods of algebraic geometry can produce criteria for the identifiability of specific t...
AbstractWe prove a criterion for the identifiability of symmetric tensors P of type 3×⋯×3, d times, ...
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...
We prove a criterion for the identifiability of symmetric tensors P of type 3x...x3 (d times), whose...
In applications where the tensor rank decomposition arises, one often relies on its identifiability ...
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...
© 2018 European Mathematical Society Publishing House. All rights reserved. We show how methods of a...
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 show how methods of algebraic geometry can produce criteria for the identifiability of specific ...
We show how methods of algebraic geometry can produce criteria for the identifiability of specific ...
We show how methods of algebraic geometry can produce criteria for the identifiability of specific t...
AbstractWe prove a criterion for the identifiability of symmetric tensors P of type 3×⋯×3, d times, ...
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...
We prove a criterion for the identifiability of symmetric tensors P of type 3x...x3 (d times), whose...
In applications where the tensor rank decomposition arises, one often relies on its identifiability ...