Description of fast matrix multiplication algorithm: ⟨4×5×6:90⟩

Algorithm type

30X2Y2Z2+X3YZ+2X2Y2Z+2X2YZ2+XY3Z+XY2Z2+7X2YZ+16XY2Z+14XYZ2+16XYZ30X2Y2Z2X3YZ2X2Y2Z2X2YZ2XY3ZXY2Z27X2YZ16XY2Z14XYZ216XYZ30*X^2*Y^2*Z^2+X^3*Y*Z+2*X^2*Y^2*Z+2*X^2*Y*Z^2+X*Y^3*Z+X*Y^2*Z^2+7*X^2*Y*Z+16*X*Y^2*Z+14*X*Y*Z^2+16*X*Y*Z

Algorithm definition

The algorithm ⟨4×5×6:90⟩ 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