We answer a question, posed implicitly in [18, §11], [11, Rem. 15.44] and explicitly in [9, Problem 9.8], showing the border rank of the Kronecker square of the little Coppersmith-Winograd tensor is the square of the border rank of the tensor for all q > 2, a negative result for complexity theory. We further show that when q > 4, the analogous result holds for the Kronecker cube. In the positive direction, we enlarge the list of explicit tensors potentially useful for the laser method. We observe that a well-known tensor, the 3×3 determinant polynomial regarded as a tensor, det3 ∈ C9 C9 C9, could potentially be used in the laser method to prove the exponent of matrix multiplication is two. Because of this, we prove new upper bounds on its W...
In two papers, B\"urgisser and Ikenmeyer (STOC 2011, STOC 2013) used an adaption of the geometric co...
The tensor rank of a tensor is the smallest number r such that the tensor can be decomposed as a sum...
The article is concerned with the problem of the additivity of the tensor rank. That is for two inde...
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 ...
In this work, we prove limitations on the known methods for designing matrix multiplication algorith...
An important building block in all current asymptotically fast algorithms for matrix multiplication ...
We present an upper bound on the exponent of the asymptotic behaviour of the tensor rank of a family...
Determining the exponent of matrix multiplication ? is one of the central open problems in algebraic...
Determining the asymptotic algebraic complexity of matrix multiplication, succinctly represented by ...
textabstractWe show that the border support rank of the tensor corresponding to two-by-two matrix m...
Matrix rank is multiplicative under the Kronecker product, additive under the direct sum, normalised...
We present an upper bound on the exponent of the asymptotic behaviour of the tensor rank of a family...
We introduce a method for transforming low-order tensors into higher-order tensors and apply it to t...
This is the first in a series of papers on rank decompositions of the matrix multiplication tensor. ...
In two papers, B\"urgisser and Ikenmeyer (STOC 2011, STOC 2013) used an adaption of the geometric co...
The tensor rank of a tensor is the smallest number r such that the tensor can be decomposed as a sum...
The article is concerned with the problem of the additivity of the tensor rank. That is for two inde...
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 ...
In this work, we prove limitations on the known methods for designing matrix multiplication algorith...
An important building block in all current asymptotically fast algorithms for matrix multiplication ...
We present an upper bound on the exponent of the asymptotic behaviour of the tensor rank of a family...
Determining the exponent of matrix multiplication ? is one of the central open problems in algebraic...
Determining the asymptotic algebraic complexity of matrix multiplication, succinctly represented by ...
textabstractWe show that the border support rank of the tensor corresponding to two-by-two matrix m...
Matrix rank is multiplicative under the Kronecker product, additive under the direct sum, normalised...
We present an upper bound on the exponent of the asymptotic behaviour of the tensor rank of a family...
We introduce a method for transforming low-order tensors into higher-order tensors and apply it to t...
This is the first in a series of papers on rank decompositions of the matrix multiplication tensor. ...
In two papers, B\"urgisser and Ikenmeyer (STOC 2011, STOC 2013) used an adaption of the geometric co...
The tensor rank of a tensor is the smallest number r such that the tensor can be decomposed as a sum...
The article is concerned with the problem of the additivity of the tensor rank. That is for two inde...