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

Algorithm type

36X2Y2Z2+2XY2Z2+8X2YZ+20XY2Z+16XYZ2+22XYZ36X2Y2Z22XY2Z28X2YZ20XY2Z16XYZ222XYZ36*X^2*Y^2*Z^2+2*X*Y^2*Z^2+8*X^2*Y*Z+20*X*Y^2*Z+16*X*Y*Z^2+22*X*Y*Z

Algorithm definition

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