Description of fast matrix multiplication algorithm: ⟨6×6×6:153⟩

Algorithm type

63 X^{2} Y^{2} Z^{2} + 2 X^{2} Y Z^{2} + 24 X^{2} Y Z + 25 X Y^{2} Z + 23 X Y Z^{2} + 16 X Y Z

Algorithm definition

The algorithm ⟨6×6×6:153⟩ is taken from:

Jakob Moosbauer and Michael Poole. Flip graphs with symmetry and new matrix multiplication schemes. Technical report, arXiv, February 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