论文标题
关于乘以$ 3 \ times3 $矩阵的可能短算法的自动形态组
On automorphism group of a possible short algorithm for multiplication of $3\times3$ matrices
论文作者
论文摘要
研究接受非平凡对称性的算法是构建新的矩阵乘法算法的前瞻性方法。本文的主要结果是，如果存在乘以乘以$ 3 \ times3 $矩阵的乘法长度$ l \ leq22 $的算法，则其自动形态组对$ s_l \ s_l \ times s_3 $的子组是同构的。
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 $l\leq22$ for multuplication of $3\times3$ matrices then its automorphism group is isomorphic to a subgroup of $S_l\times S_3$.
