Related papers: Hankel tensor decompositions and ranks
Totally equimodular matrices generalize totally unimodular matrices and arise in the context of box-total dual integral polyhedra. This work further explores the parallels between these two classes and introduces foundational building…
We give algorithms to compute decompositions of a given polynomial, or more generally mixed tensor, as sum of rank one tensors, and to establish whether such a decomposition is unique. In particular, we present methods to compute the…
An important building block in all current asymptotically fast algorithms for matrix multiplication are tensors with low border rank, that is, tensors whose border rank is equal or very close to their size. To find new asymptotically fast…
In this paper, we provide local and global convergence guarantees for recovering CP (Candecomp/Parafac) tensor decomposition. The main step of the proposed algorithm is a simple alternating rank-$1$ update which is the alternating version…
It is well-known that tensor decompositions show separations, that is, that constraints on local terms (such as positivity) may entail an arbitrarily high cost in their representation. Here we show that many of these separations disappear…
Suppose we are given an $n$-dimensional order-3 symmetric tensor $T \in (\mathbb{R}^n)^{\otimes 3}$ that is the sum of $r$ random rank-1 terms. The problem of recovering the rank-1 components is possible in principle when $r \lesssim n^2$…
We give constructions of n^k x n^k x n tensors of rank at least 2n^k - O(n^(k-1)). As a corollary we obtain an [n]^r shaped tensor with rank at least 2n^(r/2) - O(n^(r/2)-1) when r is odd. The tensors are constructed from a simple recursive…
In [13], Hillar and Lim famously demonstrated that "multilinear (tensor) analogues of many efficiently computable problems in numerical linear algebra are NP-hard". Despite many recent advancements, the state-of-the-art methods for…
A complete characterization is provided of Hankel matrices commuting with Jacobi matrices which correspond to hypergeometric orthogonal polynomials from the Askey scheme. It follows, as the main result of the paper, that the generalized…
We investigate the uniqueness of decomposition of general tensors $T\in {\mathbb C}^{n_1+1}\otimes\cdots\otimes{\mathbb C}^{n_r+1}$ as a sum of tensors of rank $1$. This is done extending the theory developed in a previous paper by the…
We prove a classification theorem for Hankel weighing matrices.
These lecture notes are intended as an introduction to several notions of tensor rank and their connections to the asymptotic complexity of matrix multiplication. The latter is studied with the exponent of matrix multiplication, which will…
Tensors or {\em multi-way arrays} are functions of three or more indices $(i,j,k,\cdots)$ -- similar to matrices (two-way arrays), which are functions of two indices $(r,c)$ for (row,column). Tensors have a rich history, stretching over…
Inspired by recent work of Kopparty-Moshkovitz-Zuiddam and motivated by problems in combinatorics and hypergraphs, we introduce the notion of the symmetric geometric rank of a symmetric tensor. This quantity is equal to the codimension of…
The Ehrhart polynomial and the reciprocity theorems by Ehrhart \& Macdonald are extended to tensor valuations on lattice polytopes. A complete classification is established of tensor valuations of rank up to eight that are equivariant with…
We investigate the simplest class of hyperdeterminants defined by Cayley in the case of Hankel hypermatrices (tensors of the form $A_{i_1i_2... i_k}=f(i_1+i_2+...+i_k)$). It is found that many classical properties of Hankel determinants can…
Hermitian tensors are natural generalizations of Hermitian matrices, while possessing rather different properties. A Hermitian tensor is separable if it has a Hermitian decomposition with only positive coefficients, i.e., it is a sum of…
We study the decomposition of a multivariate Hankel matrix H\_$\sigma$ as a sum of Hankel matrices of small rank in correlation with the decomposition of its symbol $\sigma$ as a sum of polynomial-exponential series. We present a new…
Let T be a general complex tensor of format $(n_1,...,n_d)$. When the fraction $\prod_in_i/[1+\sum_i(n_i-1)]$ is an integer, and a natural inequality (called balancedness) is satisfied, it is expected that T has finitely many minimal…
This paper studies the issues about tensors. Three typical kinds of tensor decomposition are mentioned. Among these decompositions, the t-SVD is proposed in this decade. Different definitions of rank derive from tensor decompositions. Based…