Hankel tensor decompositions and ranks
arXiv:1706.03631
Abstract
Hankel tensors are generalizations of Hankel matrices. This article studies the relations among various ranks of Hankel tensors. We give an algorithm that can compute the Vandermonde ranks and decompositions for all Hankel tensors. For a generic -dimensional Hankel tensor of even order or order three, we prove that the the cp rank, symmetric rank, border rank, symmetric border rank, and Vandermonde rank all coincide with each other. In particular, this implies that the Comon's conjecture is true for generic Hankel tensors when the order is even or three. Some open questions are also posed.
References in corpus (10)
- Computing symmetric rank for symmetric tensors
- Eigenvectors of tensors and algorithms for Waring decomposition
- Canonical polyadic decomposition of third-order tensors: reduction to generalized eigenvalue decomposition
- Multiarray Signal Processing: Tensor decomposition meets compressed sensing
- General Tensor Decomposition, Moment Matrices and Applications
- Tensor ranks on tangent developable of Segre varieties
- Tensor network ranks
- How hard is the tensor rank?
- Report on "Geometry and representation theory of tensors for computer science, statistics and other areas."
- Border Ranks of Monomials