Matrix multiplication via matrix groups

04/08/2022
by   Jonah Blasiak, et al.
0

In 2003, Cohn and Umans proposed a group-theoretic approach to bounding the exponent of matrix multiplication. Previous work within this approach ruled out certain families of groups as a route to obtaining ω = 2, while other families of groups remain potentially viable. In this paper we turn our attention to matrix groups, whose usefulness within this framework was relatively unexplored. We first show that groups of Lie type cannot prove ω=2 within the group-theoretic approach. This is based on a representation-theoretic argument that identifies the second-smallest dimension of an irreducible representation of a group as a key parameter that determines its viability in this framework. Our proof builds on Gowers' result concerning product-free sets in quasirandom groups. We then give another barrier that rules out certain natural matrix group constructions that make use of subgroups that are far from being self-normalizing. Our barrier results leave open several natural paths to obtain ω = 2 via matrix groups. To explore these routes we propose working in the continuous setting of Lie groups, in which we develop an analogous theory. Obtaining the analogue of ω=2 in this potentially easier setting is a key challenge that represents an intermediate goal short of actually proving ω = 2. We give two constructions in the continuous setting, each of which evades one of our two barriers.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/06/2017

Which groups are amenable to proving exponent two for matrix multiplication?

The Cohn-Umans group-theoretic approach to matrix multiplication suggest...
research
03/06/2020

Barriers for rectangular matrix multiplication

We study the algorithmic problem of multiplying large matrices that are ...
research
06/10/2018

Convolutional number-theoretic method to optimise integer matrix multiplication

There have been several algorithms designed to optimise matrix multiplic...
research
01/08/2019

Fast generalized DFTs for all finite groups

For any finite group G, we give an arithmetic algorithm to compute gener...
research
12/30/2022

Matrix Multiplication: Verifying Strong Uniquely Solvable Puzzles

Cohn and Umans proposed a framework for developing fast matrix multiplic...
research
05/03/2021

Near-Optimal Cayley Expanders for Abelian Groups

We give an efficient deterministic algorithm that outputs an expanding g...
research
05/31/2023

Orbit recovery for band-limited functions

We study the third moment for functions on arbitrary compact Lie groups....

Please sign up or login with your details

Forgot password? Click here to reset