In 2003, Cohn and Umans described a framework for proving upper bounds on the exponent ω of matrix multiplication by reducing matrix multiplication to group algebra multiplication, and in 2005 Cohn, Kleinberg, Szegedy, and Umans proposed specific conjectures for how to obtain ω=2. In this paper we rule out obtaining ω=2 in this framework from abelian groups of bounded exponent. To do this we bound the size of tricolored sum-free sets in such groups, extending the breakthrough results of Croot, Lev, Pach, Ellenberg, and Gijswijt on cap sets. As a byproduct of our proof, we show that a variant of tensor rank due to Tao gives a quantitative understanding of the notion of unstable tensor from geometric invariant theory.ISSN:2397-312
Determining the exponent of matrix multiplication ? is one of the central open problems in algebraic...
Abstract. In 2003 Cohn and Umans introduced a group-theoretic approach to fast matrix multiplication...
The asymptotic restriction problem for tensors s and t is to find the smallest β ≥ 0 such that the n...
In 2003, Cohn and Umans described a framework for proving upper bounds on the exponent ω of matrix m...
The Cohn-Umans group-theoretic approach to matrix multiplication suggests embedding matrix multiplic...
We introduce a relaxation of the notion of tensor rank, called s-rank, and show that upper bounds on...
© 2018 IEEE. We study the known techniques for designing Matrix Multiplication algorithms. The two ...
We develop a new, group-theoretic approach to bounding the exponent of matrix multiplication. There ...
G-stable rank is a new notion of tensor rank introduced by Harm Derksen. This thesis considers the a...
We further develop the group-theoretic approach to fast matrix multiplication introduced by Cohn and...
© Josh Alman and Virginia V. Williams. We consider the techniques behind the current best algorithms...
The exponent of matrix multiplication is the smallest real number ω such that for all ε>0, O(n^(ω+ε)...
textabstractWe show that the border support rank of the tensor corresponding to two-by-two matrix m...
We present an upper bound on the exponent of the asymptotic behaviour of the tensor rank of a family...
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...
Abstract. In 2003 Cohn and Umans introduced a group-theoretic approach to fast matrix multiplication...
The asymptotic restriction problem for tensors s and t is to find the smallest β ≥ 0 such that the n...
In 2003, Cohn and Umans described a framework for proving upper bounds on the exponent ω of matrix m...
The Cohn-Umans group-theoretic approach to matrix multiplication suggests embedding matrix multiplic...
We introduce a relaxation of the notion of tensor rank, called s-rank, and show that upper bounds on...
© 2018 IEEE. We study the known techniques for designing Matrix Multiplication algorithms. The two ...
We develop a new, group-theoretic approach to bounding the exponent of matrix multiplication. There ...
G-stable rank is a new notion of tensor rank introduced by Harm Derksen. This thesis considers the a...
We further develop the group-theoretic approach to fast matrix multiplication introduced by Cohn and...
© Josh Alman and Virginia V. Williams. We consider the techniques behind the current best algorithms...
The exponent of matrix multiplication is the smallest real number ω such that for all ε>0, O(n^(ω+ε)...
textabstractWe show that the border support rank of the tensor corresponding to two-by-two matrix m...
We present an upper bound on the exponent of the asymptotic behaviour of the tensor rank of a family...
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...
Abstract. In 2003 Cohn and Umans introduced a group-theoretic approach to fast matrix multiplication...
The asymptotic restriction problem for tensors s and t is to find the smallest β ≥ 0 such that the n...