Results for the Exponent ω of Matrix Multiplication
ثبت نشده
چکیده
This review paper describes certain elementary methods of group theory for studying the algebraic complexity of matrix multiplication, as measured by the exponent 2 ≤ ω ≤ 3 of matrix multiplication. which is conjectured to be 2. The seed of these methods lies in two ideas of H. Cohn, C. Umans et. al., firstly, that it is possible to " realize " a matrix product via the regular algebra of a (finite) group having a triple of subsets satisfying the so-called triple product property (TPP), and more generally, that it is possible to simultaneously realize several independent matrix products via a single group having a family of triples of subsets satisfying the so-called simultaneous triple product property (STPP), in such a way that the complexity of these several multiplications does not exceed the complexity of one multiplication in the regular algebra of the group. The STPP, in particular, has certain implications for ω which we describe.
منابع مشابه
Fast matrix multiplication using coherent configurations
We introduce a relaxation of the notion of tensor rank, called s-rank, and show that upper bounds on the s-rank of the matrix multiplication tensor imply upper bounds on the ordinary rank. In particular, if the “s-rank exponent of matrix multiplication” equals 2, then ω = 2. This connection between the s-rank exponent and the ordinary exponent enables us to significantly generalize the group-th...
متن کاملOn cap sets and the group-theoretic approach to matrix multiplication
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. In 2005 Cohn, Kleinberg, Szegedy, and Umans proposed specific conjectures for how to obtain ω = 2 in this framework. In this note we rule out obtaining ω = 2 in this framework from the groups Fp , using the breakthro...
متن کاملUniquely Solvable Puzzles and Fast Matrix Multiplication
In 2003 Cohn and Umans introduced a new group-theoretic framework for doing fast matrix multiplications, with several conjectures that would imply the matrix multiplication exponent ω is 2. Their methods have been used to match one of the fastest known algorithms by Coppersmith and Winograd, which runs in O(n2.376) time and implies that ω ≤ 2.376. This thesis discusses the framework that Cohn a...
متن کاملAn overview of the recent progress on matrix multiplication
The exponent ω of matrix multiplication is the infimum over all real numbers c such that for all ε > 0 there is an algorithm that multiplies n× n matrices using at most O(n) arithmetic operations over an arbitrary field. A trivial lower bound on ω is 2, and the best known upper bound until recently was ω < 2.376 achieved by Coppersmith and Winograd in 1987. There were two independent improvemen...
متن کاملDecoding Interleaved Gabidulin Codes using Alekhnovich's Algorithm
We prove that Alekhnovich’s algorithm can be used for row reduction of skew polynomial matrices. This yields an O(ln log(n)) decoding algorithm for l-Interleaved Gabidulin codes of length n, where ω is the matrix multiplication exponent, improving in the exponent of n compared to previous results.
متن کامل