On the geometry of geometric rank

Geometric Rank and Linear Determinantal Varieties

There are close relations between tripartite tensors with bounded geometric ranks and linear determinantal varieties with bounded codimensions. We study linear determinantal varieties with bounded codimensions, and prove upper bounds of the dimensions of the ambient spaces. Using those results, we classify tensors with geometric rank 3, find upper bounds of multilinear ranks of primitive tensors with geometric rank 4, and prove the existence of such upper bounds in general. We extend results of tripartite tensors to n-part tensors, showing the equivalence between geometric rank 1 and partition…

Geometric lower bounds for generalized ranks

We revisit a geometric lower bound for Waring rank of polynomials (symmetric rank of symmetric tensors) of Landsberg and Teitler and generalize it to a lower bound for rank with respect to arbitrary varieties, improving the bound given by the "non-Abelian" catalecticants recently introduced by Landsberg and Ottaviani. This is applied to give lower bounds for ranks of multihomogeneous polynomials (partially symmetric tensors); a special case is the simultaneous Waring decomposition problem for a linear system of polynomials. We generalize the classical Apolarity Lemma to multihomogeneous polyno…

The geometry of rank decompositions of matrix multiplication I: 2x2 matrices

This is the first in a series of papers on rank decompositions of the matrix multiplication tensor. In this paper we: establish general facts about rank decompositions of tensors, describe potential ways to search for new matrix multiplication decompositions, give a geometric proof of the theorem of Burichenko's theorem establishing the symmetry group of Strassen's algorithm, and present two particularly nice subfamilies in the Strassen family of decompositions.

Towards a Geometric Approach to Strassen's Asymptotic Rank Conjecture

We make a first geometric study of three varieties in $\mathbb{C}^m \otimes \mathbb{C}^m \otimes \mathbb{C}^m$ (for each $m$), including the Zariski closure of the set of tight tensors, the tensors with continuous regular symmetry. Our motivation is to develop a geometric framework for Strassen's Asymptotic Rank Conjecture that the asymptotic rank of any tight tensor is minimal. In particular, we determine the dimension of the set of tight tensors. We prove that this dimension equals the dimension of the set of oblique tensors, a less restrictive class introduced by Strassen.

张量的几何秩与矩阵乘法的子秩

Geometric rank of tensors and subrank of matrix multiplication

本文提出几何秩这一新工具，证明其可上界张量子秩与超图独立数，并用于给出矩阵乘法张量（边界）子秩的紧上界。

On the geometry of border rank algorithms for matrix multiplication and other tensors with symmetry

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…