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

Algorithm type

50X2Y2Z2+3X3YZ+X2YZ2+2XY3Z+XY2Z2+2XYZ3+16X2YZ+18XY2Z+16XYZ2+21XYZ50X2Y2Z23X3YZX2YZ22XY3ZXY2Z22XYZ316X2YZ18XY2Z16XYZ221XYZ50*X^2*Y^2*Z^2+3*X^3*Y*Z+X^2*Y*Z^2+2*X*Y^3*Z+X*Y^2*Z^2+2*X*Y*Z^3+16*X^2*Y*Z+18*X*Y^2*Z+16*X*Y*Z^2+21*X*Y*Z

Algorithm definition

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