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

Algorithm type

X3Y2Z2+59X2Y2Z2+2X3YZ+2X2Y2Z+X2YZ2+16X2YZ+27XY2Z+20XYZ2+22XYZX3Y2Z259X2Y2Z22X3YZ2X2Y2ZX2YZ216X2YZ27XY2Z20XYZ222XYZX^3*Y^2*Z^2+59*X^2*Y^2*Z^2+2*X^3*Y*Z+2*X^2*Y^2*Z+X^2*Y*Z^2+16*X^2*Y*Z+27*X*Y^2*Z+20*X*Y*Z^2+22*X*Y*Z

Algorithm definition

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