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

Algorithm type

X2Y5Z+2X2Y4Z+8X2Y3Z2+X2Y3Z+44X2Y2Z2+XY4Z+XY3Z2+X2Y2Z+X2YZ2+6XY3Z+XY2Z2+XYZ3+12X2YZ+21XY2Z+13XYZ2+30XYZX2Y5Z2X2Y4Z8X2Y3Z2X2Y3Z44X2Y2Z2XY4ZXY3Z2X2Y2ZX2YZ26XY3ZXY2Z2XYZ312X2YZ21XY2Z13XYZ230XYZX^2*Y^5*Z+2*X^2*Y^4*Z+8*X^2*Y^3*Z^2+X^2*Y^3*Z+44*X^2*Y^2*Z^2+X*Y^4*Z+X*Y^3*Z^2+X^2*Y^2*Z+X^2*Y*Z^2+6*X*Y^3*Z+X*Y^2*Z^2+X*Y*Z^3+12*X^2*Y*Z+21*X*Y^2*Z+13*X*Y*Z^2+30*X*Y*Z

Algorithm definition

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