Description of fast matrix multiplication algorithm: ⟨5×5×7:127⟩

Algorithm type

X3Y2Z2+47X2Y2Z2+3X3YZ+X2YZ2+XYZ3+9X2YZ+20XY2Z+19XYZ2+26XYZX3Y2Z247X2Y2Z23X3YZX2YZ2XYZ39X2YZ20XY2Z19XYZ226XYZX^3*Y^2*Z^2+47*X^2*Y^2*Z^2+3*X^3*Y*Z+X^2*Y*Z^2+X*Y*Z^3+9*X^2*Y*Z+20*X*Y^2*Z+19*X*Y*Z^2+26*X*Y*Z

Algorithm definition

The algorithm ⟨5×5×7:127⟩ is taken from:

Manuel Kauers and Issaac Wood. Consequences of the Moosbauer-Poole algorithms. Technical Report 2505.05896, arXiv, May 2025. [ arXiv ]

Algorithm description

These encodings are given in compressed text format using the maple computer algebra system. In each cases, the last line could be understood as a description of the encoding with respect to classical matrix multiplication algorithm. As these outputs are structured, one can construct easily a parser to its favorite format using the maple documentation without this software.


Back to main table