On automorphism group of a possible short algorithm for multiplication of $3\times3$ matrices
Computational Complexity
2022-11-15 v1 Group Theory
Abstract
Studying algorithms admitting nontrivial symmetries is a prospective way of constructing new short algorithms of matrix multiplication. The main result of the article is that if there exists an algorithm of multiplicative length for multuplication of matrices then its automorphism group is isomorphic to a subgroup of .
Keywords
Cite
@article{arxiv.2211.06485,
title = {On automorphism group of a possible short algorithm for multiplication of $3\times3$ matrices},
author = {Vladimir Burichenko},
journal= {arXiv preprint arXiv:2211.06485},
year = {2022}
}
Comments
11 pp. To be submitted to European J. Math