相关论文: A note on the gap between rank and border rank

We study the subrank of real order-three tensors and give an upper bound to the subrank of a real tensor given its complex subrank. Using similar arguments to those used by Bernardi-Blekherman-Ottaviani, we show that all subranks between…

Tensor type data are becoming important recently in various application fields. We determine a rank of a tensor T so that A+T is diagonalizable for a given 3-tensor A with 2 slices over the complex and real number field.

We propose a numerical method to obtain an adequate value for the upper bound on the rank for the tensor completion problem on the variety of third-order tensors of bounded tensor-train rank. The method is inspired by the parametrization of…

In this paper, we study typical ranks of 3-tensors and show that there are plural typical ranks for m\times n\times p tensors over R in the following cases: (1) 3\leq m\leq \rho(n) and (m-1)(n-1)+1\leq p\leq (m-1)n, where \rho\ is the…

For odd n, I write down tensors in C^n\otimes C^n\otimes C^n of border rank 2n-1, showing the non-triviality of the Young-flattening equations of Landsberg-Ottaviani. I also study the border rank of the tensors of Alexeev et. al., showing…

Given tensors $T$ and $T'$ of order $k$ and $k'$ respectively, the tensor product $T \otimes T'$ is a tensor of order $k+k'$. It was recently shown that the tensor rank can be strictly submultiplicative under this operation…

Tensors decompositions are a class of tools for analysing datasets of high dimensionality and variety in a natural manner, with the Canonical Polyadic Decomposition (CPD) being a main pillar. While the notion of CPD is closely intertwined…

The structure tensor of $\mathfrak{sl}_n$, denoted $T_{\mathfrak{sl}_n}$, is the tensor arising from the Lie bracket bilinear operation on the set of traceless $n \times n$ matrices over $\mathbb{C}$. This tensor is intimately related to…

The determination of the maximal ranks of a set of a given type of tensors is a basic problem both in theory and application. In statistical applications, the maximal rank is related to the number of necessary parameters to be built in a…

This paper is devoted to the study of lower and upper bounds for the number of vertices of the polytope of $n\times n\times n$ stochastic tensors (i.e., triply stochastic arrays of dimension $n$). By using known results on polytopes (i.e.,…

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…

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…

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…

Raz's recent result \cite{Raz2010} has rekindled people's interest in the study of \emph{tensor rank}, the generalization of matrix rank to high dimensions, by showing its connections to arithmetic formulas. In this paper, we follow Raz's…

In this paper, we show that the low rank matrix completion problem can be reduced to the problem of finding the rank of a certain tensor.

A symmetric tensor may be regarded as a partially symmetric tensor in several different ways. These produce different notions of rank for the symmetric tensor which are related by chains of inequalities. By exploiting algebraic tools such…

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…

Let $d \ge 2, h \ge 1$ be integers. Using a fragmentation technique, we characterise $(h+1)$-tuples $(R_1, \dots, R_h, R)$ of non-empty families of partitions of $\{1, \dots, d\}$ such that it suffices for an order-$d$ tensor to have…

The purpose of this note is to give a linear algebra algorithm to find out if a rank of a given tensor over a field $\F$ is at most $k$ over the algebraic closure of $\F$, where $k$ is a given positive integer. We estimate the arithmetic…

We study the generic and typical ranks of 3-tensors of dimension l x m x n using results from matrices and algebraic geometry. We state a conjecture about the exact values of the generic rank of 3-tensors over the complex numbers, which is…