Related papers: Hankel tensor decompositions and ranks

In this article we prove the subrank of a generic tensor in $\mathbb{C}^{n,n,n}$ to be $Q(n) = \lfloor\sqrt{3n - 2}\rfloor$ by providing a lower bound to the known upper bound. More generally, we find the generic subrank of tensors of all…

Shitov recently gave a counterexample to Comon's conjecture that the symmetric tensor rank and tensor rank of a symmetric tensor are the same. In this paper we show that an analog of Comon's conjecture for the G-stable rank introduced by…

We propose a new sufficient condition for verifying whether generic rank-r complex tensors of arbitrary order admit a unique decomposition as a linear combination of rank-1 tensors. A practical algorithm is proposed for verifying this…

In this paper we introduce a new method to produce lower bounds for the Waring rank of symmetric tensors. We also introduce the notion of $e$-computability and we use it to prove that Strassen's Conjecture holds in infinitely many new…

In problems involving approximation, completion, denoising, dimension reduction, estimation, interpolation, modeling, order reduction, regression, etc, we argue that the near-universal practice of assuming that a function, matrix, or tensor…

We investigate convex polytopes of doubly stochastic matrices having special structures: symmetric, Hankel symmetric, centrosymmetric, and both symmetric and Hankel symmetric. We determine dimensions of these polytopes and classify their…

This is the second in a series of papers on rank decompositions of the matrix multiplication tensor. We present new rank $23$ decompositions for the $3\times 3$ matrix multiplication tensor $M_{\langle 3\rangle}$. All our decompositions…

Higher-order tensors are becoming prevalent in many scientific areas such as computer vision, social network analysis, data mining and neuroscience. Traditional tensor decomposition approaches face three major challenges: model selecting,…

Notions of rank abound in the literature on tensor decomposition. We prove that strength, recently introduced for homogeneous polynomials by Ananyan-Hochster in their proof of Stillman's conjecture and generalised here to other tensors, is…

We address the problem of the additivity of the tensor rank. That is for two independent tensors we study if the rank of their direct sum is equal to the sum of their individual ranks. A positive answer to this problem was previously known…

I study Hankel determinants of a class of sequences which can be interpreted as generalizations of the Catalan numbers and the central binomial coefficients. They follow a modular pattern with a frequent appearance of zeroes, so that the…

In this paper, we focus on a special class of symmetric tensors, which can be orthogonally diagonalizable, and investigate their Z-eigenpairs problem. We show that the eigenpairs can be uniformly expressed using several basic eigenpairs,…

One deals with degenerations by coordinate sections of the square generic Hankel matrix over a field $k$ of characteristic zero, along with its main related structures, such as the determinant of the matrix, the ideal generated by its…

We define a general product of two $n$-dimensional tensors $\mathbb {A}$ and $\mathbb {B}$ with orders $m\ge 2$ and $k\ge 1$, respectively. This product is a generalization of the usual matrix product, and satisfies the associative law.…

Tensor Kronecker products, the natural generalization of the matrix Kronecker product, are independently emerging in multiple research communities. Like their matrix counterpart, the tensor generalization gives structure for implicit…

We introduce an elementary method to study the border rank of polynomials and tensors, analogous to the apolarity lemma. This can be used to describe the border rank of all cases uniformly, including those very special ones that resisted a…

A tensor is a multi-way array that can represent, in addition to a data set, the expression of a joint law or a multivariate function. As such it contains the description of the interactions between the variables corresponding to each of…

We propose a new numerical algorithm for computing the tensor rank decomposition or canonical polyadic decomposition of higher-order tensors subject to a rank and genericity constraint. Reformulating this computational problem as a system…

We consider sets of fixed CP, multilinear, and TT rank tensors, and derive conditions for when (the smooth parts of) these sets are smooth homogeneous manifolds. For CP and TT ranks, the conditions are essentially that the rank is…

We prove that the general symmetric tensor in $S^d {\mathbb C}^{n+1}$ of rank r is identifiable, provided that r is smaller than the generic rank. That is, its Waring decomposition as a sum of r powers of linear forms is unique. Only three…