On cap sets and the group-theoretic approach to matrix multiplication
Combinatorics
2017-01-17 v4 Data Structures and Algorithms
Group Theory
Abstract
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 . In this paper we rule out obtaining 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.
Keywords
Cite
@article{arxiv.1605.06702,
title = {On cap sets and the group-theoretic approach to matrix multiplication},
author = {Jonah Blasiak and Thomas Church and Henry Cohn and Joshua A. Grochow and Eric Naslund and William F. Sawin and Chris Umans},
journal= {arXiv preprint arXiv:1605.06702},
year = {2017}
}
Comments
27 pages