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

Algorithm type

X3Y2Z2+10X2Y3Z2+XYZ5+58X2Y2Z2+3XYZ4+4X3YZ+X2Y2Z+8XY3Z+7XY2Z2+XYZ3+19X2YZ+25XY2Z+15XYZ2+23XYZX3Y2Z210X2Y3Z2XYZ558X2Y2Z23XYZ44X3YZX2Y2Z8XY3Z7XY2Z2XYZ319X2YZ25XY2Z15XYZ223XYZX^3*Y^2*Z^2+10*X^2*Y^3*Z^2+X*Y*Z^5+58*X^2*Y^2*Z^2+3*X*Y*Z^4+4*X^3*Y*Z+X^2*Y^2*Z+8*X*Y^3*Z+7*X*Y^2*Z^2+X*Y*Z^3+19*X^2*Y*Z+25*X*Y^2*Z+15*X*Y*Z^2+23*X*Y*Z

Algorithm definition

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