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

Algorithm type

2 X^{5} Y Z + 2 X^{3} Y^{2} Z^{2} + 2 X^{2} Y^{3} Z^{2} + 5 X^{2} Y^{2} Z^{3} + 60 X^{2} Y^{2} Z^{2} + X^{2} Y Z^{3} + X Y Z^{4} + 8 X^{3} Y Z + X^{2} Y^{2} Z + 2 X^{2} Y Z^{2} + X Y^{3} Z + 6 X Y Z^{3} + 23 X^{2} Y Z + 26 X Y^{2} Z + 21 X Y Z^{2} + 22 X Y Z

Algorithm definition

The algorithm ⟨6×6×7:183⟩ is taken from:

Manuel Kauers and Issaac Wood. Consequences of the Moosbauer-Poole algorithms. Technical Report 2505.05896, arXiv, May 2025. [ arXiv ]

Algorithm description

maple tensor representation (compressed by bzip2);
maple LRP representation (compressed by bzip2);
maple evaluation scheme (compressed by bzip2).

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