Description of fast matrix multiplication algorithm: ⟨7×9×11:478⟩

Algorithm type

12 X^{4} Y^{4} Z^{4} + 3 X^{6} Y^{2} Z^{2} + 6 X^{4} Y^{3} Z^{3} + X^{4} Y^{2} Z^{4} + 10 X^{3} Y^{4} Z^{3} + 4 X^{2} Y^{6} Z^{2} + 4 X^{2} Y^{4} Z^{4} + 3 X^{2} Y^{2} Z^{6} + 2 X Y^{6} Z^{3} + 4 X^{5} Y^{2} Z^{2} + X^{3} Y^{4} Z^{2} + 2 X^{3} Y^{2} Z^{4} + 2 X^{2} Y^{5} Z^{2} + X^{2} Y^{4} Z^{3} + 5 X^{2} Y^{2} Z^{5} + 2 X Y^{5} Z^{3} + X^{3} Y^{3} Z^{2} + 5 X^{3} Y^{2} Z^{3} + 40 X^{2} Y^{4} Z^{2} + 4 X^{2} Y^{3} Z^{3} + 7 X^{2} Y^{2} Z^{4} + 10 X Y^{6} Z + X Y^{4} Z^{3} + X^{2} Y^{4} Z + 8 X^{2} Y^{3} Z^{2} + 9 X^{2} Y^{2} Z^{3} + 4 X Y^{5} Z + 9 X Y^{4} Z^{2} + X Y^{3} Z^{3} + 2 X Y^{2} Z^{4} + X^{4} Y Z + 13 X^{3} Y^{2} Z + 2 X^{3} Y Z^{2} + X^{2} Y^{3} Z + 56 X^{2} Y^{2} Z^{2} + 6 X^{2} Y Z^{3} + 11 X Y^{4} Z + 11 X Y^{3} Z^{2} + 13 X Y^{2} Z^{3} + 2 X Y Z^{4} + 14 X^{3} Y Z + 9 X^{2} Y^{2} Z + 12 X^{2} Y Z^{2} + 21 X Y^{3} Z + 30 X Y^{2} Z^{2} + 18 X Y Z^{3} + 16 X^{2} Y Z + 32 X Y^{2} Z + 26 X Y Z^{2} + 20 X Y Z

Algorithm definition

The algorithm ⟨7×9×11:478⟩ is taken from:

Andrew I. Perminov. FastMatrixMultiplication, GitHub, February 2026. [ GitHub repository ]

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