Related papers: Secant varieties and the complexity of matrix mult…

We survey results in algebraic complexity theory, focusing on matrix multiplication. Our goals are (i.) to show how open questions in algebraic complexity theory are naturally posed as questions in geometry and representation theory, (ii.)…

We consider here the problem, which is quite classical in Algebraic geometry, of studying the secant varieties of a projective variety $X$. The case we concentrate on is when $X$ is a Veronese variety, a Grassmannian or a Segre variety. Not…

We introduce the concise secant varieties, which are, informally speaking, modular partial desingularisations of secant varieties to Segre embeddings. More precisely, they are projective and birational to the abstract secant varieties, yet…

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…

We study the problem of characterizing linear preserver subgroups of algebraic varieties, with a particular emphasis on secant varieties and other varieties of tensors. We introduce a number of techniques built on different geometric…

In this paper, we give a survey of the known results concerning the tensor rank of the multiplication in finite extensions of finite fields, enriched with some not published recent results as well as analyzes enhancing the qualitative…

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 computationally challenging classical elimination theory problem is to compute polynomials which vanish on the set of tensors of a given rank. By moving away from computing polynomials via elimination theory to computing pseudowitness…

New classes of modules of equations for secant varieties of Veronese varieties are defined using representation theory and geometry. Some old modules of equations (catalecticant minors) are revisited to determine when they are sufficient to…

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…

We determine normal forms and ranks of tensors of border rank at most three. We present a differential-geometric analysis of limits of secant planes in a more general context. In particular there are at most four types of points on limiting…

Tensors, or multi-linear forms, are important objects in a variety of areas from analytics, to combinatorics, to computational complexity theory. Notions of tensor rank aim to quantify the "complexity" of these forms, and are thus also…

We introduce subspace rank as a tool for studying ranks of tensors and X-rank more generally. We derive a new upper bound for the rank of a tensor and determine the ranks of partially symmetric tensors in C^2 \otimes C^b \otimes C^b. We…

In this paper we prove, using a refinement of Terracini's Lemma, a sharp lower bound for the degree of (higher) secant varieties to a given projective variety, which extends the well known lower bound for the degree of a variety in terms of…

We consider the problem of determining the symmetric tensor rank for symmetric tensors with an algebraic geometry approach. We give algorithms for computing the symmetric rank for $2\times ... \times 2$ tensors and for tensors of small…

We make an in-depth study of the known border rank (i.e. approximate) algorithms for the matrix multiplication tensor encoding the multiplication of an n x 2 matrix by a 2 x 2 matrix.

Border complexity captures functions that can be approximated by low-complexity ones. Debordering is the task of proving an upper bound on some non-border complexity measure in terms of a border complexity measure, thus getting rid of…

In this paper we present a way of computing the degree of the secant (resp., tangent) variety of a smooth projective surface, under the assumption that the divisor giving the embedding in the projective space is $3$-very ample. This method…

In the 1980's, work of Green and Lazarsfeld helped to uncover the beautiful interplay between the geometry of the embedding of a curve and the syzygies of its defining equations. Similar results hold for the first secant variety of a curve,…

Many fundamental questions in theoretical computer science are naturally expressed as special cases of the following problem: Let $G$ be a complex reductive group, let $V$ be a $G$-module, and let $v,w$ be elements of $V$. Determine if $w$…