A Normal Form for Matrix Multiplication Schemes
share
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.
READ FULL TEXT
