The study of the ranks and border ranks of tensors is an active area of research. By the example of determining the complexity of matrix multiplication I introduce the reader to the notion of the rank and border rank of a tensor. Then, after presenting basic preliminary material from algebraic geometry and multilinear algebra,I quantify precisely what it means for some tensor to be of given rank, border rank,symmetric rank or symmetric rank. Objects of a given (symmetric) border rank are then interpreted geometrically as elements of certain secant varieties of Veronese and Segre varieties. Using this, I describe some of the techniques used to arrive at the classification of all (3,3,3) presented by Kok Omn Ng. The main result of this thesi...
Determining the complexity of matrix multiplication has been a central problem in complexity theory ...
This is the first in a series of papers on rank decompositions of the matrix multiplication tensor. ...
In this thesis, we tackle the problem of matrix multiplication complexity. Matrix multiplication, wh...
AbstractThe border rank of a nondegenerate m×n×(mn−q) tensor over the complex field is mn−q provided...
This is a survey primarily about determining the border rank of tensors, especially those relevant f...
An important building block in all current asymptotically fast algorithms for matrix multiplication ...
AbstractThe typical rank (= maximal border rank) of tensors of a given size and the set of optimal b...
AbstractLet V1, V2 and V3 be vector spaces over any field k. An element T∈V1⊗V2⊗V3 induces for each ...
AbstractTensor type data are becoming important recently in various application fields. We determine...
This is the first in a series of papers on rank decompositions of the matrix multiplication tensor. ...
AbstractWe study the generic and typical ranks of 3-tensors of dimension l×m×n using results from ma...
Tensors, or multi-linear forms, are important objects in a variety of areas from analytics, to combi...
AbstractUpper bounds on the typical rank R(n, m, l) of tensors ( = maximal border rank = rank of alm...
Matrix multiplication is commonly used in scientific computation. Given matrices A = (aij ) of size ...
We prove that the border rank of the Kronecker square of the little Coppersmith–Winograd tensor Tcw,...
Determining the complexity of matrix multiplication has been a central problem in complexity theory ...
This is the first in a series of papers on rank decompositions of the matrix multiplication tensor. ...
In this thesis, we tackle the problem of matrix multiplication complexity. Matrix multiplication, wh...
AbstractThe border rank of a nondegenerate m×n×(mn−q) tensor over the complex field is mn−q provided...
This is a survey primarily about determining the border rank of tensors, especially those relevant f...
An important building block in all current asymptotically fast algorithms for matrix multiplication ...
AbstractThe typical rank (= maximal border rank) of tensors of a given size and the set of optimal b...
AbstractLet V1, V2 and V3 be vector spaces over any field k. An element T∈V1⊗V2⊗V3 induces for each ...
AbstractTensor type data are becoming important recently in various application fields. We determine...
This is the first in a series of papers on rank decompositions of the matrix multiplication tensor. ...
AbstractWe study the generic and typical ranks of 3-tensors of dimension l×m×n using results from ma...
Tensors, or multi-linear forms, are important objects in a variety of areas from analytics, to combi...
AbstractUpper bounds on the typical rank R(n, m, l) of tensors ( = maximal border rank = rank of alm...
Matrix multiplication is commonly used in scientific computation. Given matrices A = (aij ) of size ...
We prove that the border rank of the Kronecker square of the little Coppersmith–Winograd tensor Tcw,...
Determining the complexity of matrix multiplication has been a central problem in complexity theory ...
This is the first in a series of papers on rank decompositions of the matrix multiplication tensor. ...
In this thesis, we tackle the problem of matrix multiplication complexity. Matrix multiplication, wh...