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

Algorithm type

40X2Y2Z2+2X3YZ+X2YZ2+3XY3Z+XY2Z2+3XYZ3+12X2YZ+14XY2Z+13XYZ2+21XYZ40X2Y2Z22X3YZX2YZ23XY3ZXY2Z23XYZ312X2YZ14XY2Z13XYZ221XYZ40*X^2*Y^2*Z^2+2*X^3*Y*Z+X^2*Y*Z^2+3*X*Y^3*Z+X*Y^2*Z^2+3*X*Y*Z^3+12*X^2*Y*Z+14*X*Y^2*Z+13*X*Y*Z^2+21*X*Y*Z

Algorithm definition

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