A Normal Form for Matrix Multiplication Schemes
Computational Complexity
2022-06-02 v1
Abstract
Schemes for exact multiplication of small matrices have a large symmetry group. This group defines an equivalence relation on the set of multiplication schemes. There are algorithms to decide whether two schemes are equivalent. However, for a large number of schemes a pairwise equivalence check becomes cumbersome. In this paper we propose an algorithm to compute a normal form of matrix multiplication schemes. This allows us to decide pairwise equivalence of a larger number of schemes efficiently.
Cite
@article{arxiv.2206.00550,
title = {A Normal Form for Matrix Multiplication Schemes},
author = {Manuel Kauers and Jakob Moosbauer},
journal= {arXiv preprint arXiv:2206.00550},
year = {2022}
}
Comments
11 pages