Whereas matrix rank is additive under direct sum, in 1981 Schönhage showed that one of its generalizations to the tensor setting, tensor border rank, can be strictly subadditive for tensors of order three. Whether border rank is additive for higher order tensors has remained open. In this work, we settle this problem by providing analogs of Schönhage's construction for tensors of order four and higher. Schönhage's work was motivated by the study of the computational complexity of matrix multiplication; we discuss implications of our results for the asymptotic rank of higher order generalizations of the matrix multiplication tensor.
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 as Strassen's conjecture until recent counterexamples were proposed by Shitov. The latter are not very explicit, and they are only known to exist asymptotically for very large tensor spaces. In this article we prove that for some small three-way tensors the additivity holds. For instance, if the rank of one of the tensors is at most 6, then the additivity ho…
We give a sufficient condition for the strong symmetric version of Strassen's additivity conjecture: the Waring rank of a sum of forms in independent variables is the sum of their ranks, and every Waring decomposition of the sum is a sum of decompositions of the summands. We give additional sufficient criteria for the additivity of Waring ranks and a sufficient criterion for additivity of cactus ranks and decompositions.
Let M_n denote the matrix multiplication tensor for nxn matrices. We use the border substitution method combined with Koszul flattenings to prove the border rank lower bound of 2n^2-log(n)-1 for M_n.
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 the tensors their tensors T_{2^k}, despite having rank equal to 2^{k+1}-1, have border rank equal to 2^k, the minimum of any concise tensor. I also study the equations of Griesser.
We establish basic information about border rank algorithms for the matrix multiplication tensor and other tensors with symmetry. We prove that border rank algorithms for tensors with symmetry (such as matrix multiplication and the determinant polynomial) come in families that include representatives with normal forms. These normal forms will be useful both to develop new efficient algorithms and to prove lower complexity bounds. We derive a border rank version of the substitution method used in proving lower bounds for tensor rank. We use this border-substitution method and a normal form to i…
We write down an explicit sequence of tensors in $C^m\otimes C^m\otimes C^m$, for all $m$ sufficiently large, having border rank at least $2.02m$, overcoming a longstanding barrier. We obtain our lower bounds via the border substitution method.
We determine the border ranks of tensors that could potentially advance the known upper bound for the exponent $ω$ of matrix multiplication. The Kronecker square of the small $q=2$ Coppersmith-Winograd tensor equals the $3\times 3$ permanent, and could potentially be used to show $ω=2$. We prove the negative result for complexity theory that its border rank is $16$, resolving a longstanding problem. Regarding its $q=4$ skew cousin in $ C^5\otimes C^5\otimes C^5$, which could potentially be used to prove $ω\leq 2.11$, we show the border rank of its Kronecker square is at most $42$, a remarkable…
We prove that the border rank of the Kronecker square of the little Coppersmith-Winograd tensor $T_{cw,q}$ is the square of its border rank for $q > 2$ and that the border rank of its Kronecker cube is the cube of its border rank for $q > 4$. This answers questions raised implicitly in [Coppersmith-Winograd, 1990] and explicitly in [Bläser, 2013] and rules out the possibility of proving new upper bounds on the exponent of matrix multiplication using the square or cube of a little Coppersmith-Winograd tensor in this range. In the positive direction, we enlarge the list of explicit tensors poten…
The border rank of the matrix multiplication operator for n by n matrices is a standard measure of its complexity. Using techniques from algebraic geometry and representation theory, we show the border rank is at least 2n^2-n. Our bounds are better than the previous lower bound (due to Lickteig in 1985) of 3/2 n^2+ n/2 -1 for all n>2. The bounds are obtained by finding new equations that bilinear maps of small border rank must satisfy, i.e., new equations for secant varieties of triple Segre products, that matrix multiplication fails to satisfy.
We present new methods for determining polynomials in the ideal of the variety of bilinear maps of border rank at most r. We apply these methods to several cases including the case r = 6 in the space of bilinear maps C^4 x C^4 -> C^4. This space of bilinear maps includes the matrix multiplication operator M_2 for two by two matrices. We show these newly obtained polynomials do not vanish on the matrix multiplication operator M_2, which gives a new proof that the border rank of the multiplication of 2 x 2 matrices is seven. Other examples are considered along with an explanation of how to imple…
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 algorithms for matrix multiplication, it seems to be important to understand those tensors whose border rank is as small as possible, so called tensors of minimal border rank. We investigate the connection between degenerations of associative algebras and degenerations of their structure tensors in the sense of Strassen. It allows us to describe an open subse…
Fix integers $m \ge 2$, $s\ge 5$ and $d\ge 2s+2$. Here we describe the possible symmetric tensor ranks $\le 2d+s-7$ of all symmetric tensors (or homogeneous degree $d$ polynomials) in $m+1$ variables with border rank $s$.
In this work we give the classification of real ternary cubic forms with respect to rank and border rank up to SL(3)-action and we examine the differences with the complex case.
We study tensors in $\C^{m\times n\times l}$ whose border rank is $l$. We characterize the tensors in $\C^{3\times 3\times 4}$ and in $\C^{4\times 4\times 4}$ of border rank 4 at most.
We investigate an extension of a lower bound on the Waring (cactus) rank of homogeneous forms due to Ranestad and Schreyer. We show that for particular classes of homogeneous forms, for which a generalization of this method applies, the lower bound extends to the level of border (cactus) rank. The approach is based on recent results on tensor asymptotic rank.
We consider higher secant varieties to Veronese varieties. Most points on the r-th secant variety are represented by a finite scheme of length r contained in the Veronese variety --- in fact, for generic point, it is just a union of r distinct points. A modern way to phrase it is: the smoothable rank is equal to the border rank for most polynomials. This property is very useful for studying secant varieties, especially, whenever the smoothable rank is equal to the border rank for all points of the secant variety in question. In this note we investigate those special points for which the smooth…
Motivated by questions arising in signal processing, computational complexity, and other areas, we study the ranks and border ranks of symmetric tensors using geometric methods. We provide improved lower bounds for the rank of a symmetric tensor (i.e., a homogeneous polynomial) obtained by considering the singularities of the hypersurface defined by the polynomial. We obtain normal forms for polynomials of border rank up to five, and compute or bound the ranks of several classes of polynomials, including monomials, the determinant, and the permanent.
The article is concerned with the problem of the additivity of the tensor rank. That is for two independent tensors we study when the rank of their direct sum is equal to the sum of their individual ranks. The statement saying that additivity always holds was previously known as Strassen's conjecture (1969) until Shitov proposed counterexamples (2019). They are not explicit and only known to exist asymptotically for very large tensor spaces. In this article, we show that for some small three-way tensors the additivity holds. For instance, we give a proof that another conjecture stated by Stras…
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 systematic approach. We also define a border rank version of the variety of sums of powers and analyse its usefulness in studying tensors and polynomials with large symmetries. In particular, it can be applied to provide lower bounds for the border rank of some very interesting tensors, such as the matrix multiplication tensor. We work in a general setting, …
Wild forms are homogeneous polynomials whose smoothable rank is strictly larger than their border rank. The discrepancy between these two ranks is caused by the difference between the limit of spans of a family of zero-dimensional schemes and the span of their flat limit. For concise forms of minimal border rank, we show that the condition of vanishing Hessian is equivalent to being wild. This is proven by making a detour through structure tensors of smoothable and Gorenstein algebras. The equivalence fails in the non-minimal border rank regime. We exhibit an infinite series of minimal border …
It has recently been shown that the tensor rank can be strictly submultiplicative under the tensor product, where the tensor product of two tensors is a tensor whose order is the sum of the orders of the two factors. The necessary upper bounds were obtained with help of border rank. It was left open whether border rank itself can be strictly submultiplicative. We answer this question in the affirmative. In order to do so, we construct lines in projective space along which the border rank drops multiple times and use this result in conjunction with a previous construction for a tensor rank drop…
We study cubic surfaces as symmetric tensors of format $4 \times 4 \times 4$. We consider the non-symmetric tensor rank and the symmetric Waring rank of cubic surfaces, and show that the two notions coincide over the complex numbers. The corresponding algebraic problem concerns border ranks. We show that the non-symmetric border rank coincides with the symmetric border rank for cubic surfaces. As part of our analysis, we obtain minimal ideal generators for the symmetric analogue to the secant variety from the salmon conjecture. We also give a test for symmetric rank given by the non-vanishing …
We introduce various notions of rank for a symmetric tensor, namely: rank, border rank, catalecticant rank, generalized rank, scheme length, border scheme length, extension rank and smoothable rank. We analyze the stratification induced by these ranks. The mutual relations between these stratifications, allow us to describe the hierarchy among all the ranks. We show that strict inequalities are possible between rank, border rank, extension rank and catalecticant rank. Moreover we show that scheme length, generalized rank and extension rank coincide.
Let $σ_b(X_{m,d}(\mathbb {C}))(\mathbb {R})$, $b(m+1) < \binom{m+d}{m}$, denote the set of all degree $d$ real homogeneous polynomials in $m+1$ variables (i.e. real symmetric tensors of format $(m+1)\times ... \times (m+1)$, $d$ times) which have border rank $b$ over $\mathbb {C}$. It has a partition into manifolds of real dimension $\le b(m+1)-1$ in which the real rank is constant. A typical rank of $σ_b(X_{m,d}(\mathbb {C}))(\mathbb {R})$ is a rank associated to an open part of dimension $b(m+1)-1$. Here we classify all typical ranks when $b\le 7$ and $d, m$ are not too small. For a larger s…
We give the stratification by the symmetric tensor rank of all degree $d \ge 9$ homogeneous polynomials with border rank $5$ and which depend essentially on at least 5 variables, extending previous works (A. Bernardi, A. Gimigliano, M. Idà, E. Ballico) on lower border ranks. For the polynomials which depend on at least 5 variables only 5 ranks are possible: $5$, $d+3$, $2d+1$, $3d-1$, $4d-3$, but each of the ranks $3d-1$ and $2d+1$ is achieved in two geometrically different situations. These ranks are uniquely determined by a certain degree 5 zero-dimensional scheme $A$ associated to the polyn…
The $X$-rank of a point $p$ in projective space is the minimal number of points of an algebraic variety $X$ whose linear span contains $p$. This notion is naturally submultiplicative under tensor product. We study geometric conditions that guarantee strict submultiplicativity. We prove that in the case of points of rank two, strict submultiplicativity is entirely characterized in terms of the trisecant lines to the variety. Moreover, we focus on the case of curves: we prove that for curves embedded in an even-dimensional projective space, there are always points for which strict submultiplicat…
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 be expressed in terms of tensor (border) rank, (border) symmetric rank and the asymptotic rank of certain tensors. We introduce the multilinear rank of a tensor as well, deal with the concept of tensor equivalence and study prehomogeneous vector spaces with the castling transform. Moreover, we treat Apolarity Theory and use it to determine the symmetric rank…
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 well studied matrix multiplication tensor. Studying the structure tensor of $\mathfrak{sl}_n$ may provide further insight into the complexity of matrix multiplication and the "hay in a haystack" problem of finding explicit sequences tensors with high rank or border rank. We aim to find new bounds on the rank and border rank of this structure tensor in the …
In the first part of this paper we study a best approximation of a vector in Euclidean space R^n with respect to a closed semi-algebraic set C and a given semi-algebraic norm. Assuming that the given norm and its dual norm are differentiable we show that a best approximation is unique outside a hypersurface. We then study the case where C is an irreducible variety and the approximation is with respect to the Euclidean norm. We show that for a general point in x in R^n the number of critical points of the distance function of x to C is bounded above by a degree of a related dominant map. If C i…
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 $n$-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.
In this article, we verify the additivity for rank of a sum of coprime monomials and bivariate polynomials generalizing the result in (\cite{CCG}). We also show similar results hold for cactus rank.
We give an upper bound for the rank of the border rank 3 partially symmetric tensors. In the special case of border rank 3 tensors $T\in V_1\otimes \cdots \otimes V_k$ (Segre case) we can show that all ranks among 3 and $k-1$ arise and if $\dim V_i \geq 3$ for all $i$'s, then also all the ranks between $k$ and $2k-1$ arise.
We study three variations of the Waring problem for polynomials, concerning the Waring rank, the border rank and the cactus rank of a form and we show how the Lefschetz properties of the associated algebra affect them. The main tool is the theory of mixed Hessian matrix. We construct new families of wild forms, that is, forms whose cactus rank, of schematic nature, is bigger then the border rank, defined geometrically.
GIPSA-Lab CNRS（GIPSA实验室 法国国家科学研究中心）；University of Chicago（芝加哥大学）；Academy of Mathematics and Systems Science, Chinese Academy of Sciences（中国科学院数学与系统科学研究院）
