Description of fast matrix multiplication algorithm: ⟨10×11×15:1050⟩

Algorithm type

X^{6} Y^{3} Z^{4} + 10 X^{4} Y^{5} Z^{4} + X^{6} Y^{2} Z^{4} + 50 X^{4} Y^{4} Z^{4} + 4 X^{2} Y^{6} Z^{4} + 4 X^{2} Y^{2} Z^{8} + 3 X^{6} Y^{3} Z^{2} + 2 X^{4} Y^{3} Z^{4} + 2 X^{2} Y^{5} Z^{4} + 2 X Y^{8} Z^{2} + 13 X^{6} Y^{2} Z^{2} + 2 X^{4} Y^{4} Z^{2} + 4 X^{4} Y^{2} Z^{4} + 49 X^{2} Y^{6} Z^{2} + 4 X^{2} Y^{4} Z^{4} + 9 X^{2} Y^{2} Z^{6} + 10 X Y^{8} Z + 3 X Y^{7} Z^{2} + 2 X^{4} Y^{3} Z^{2} + 24 X^{2} Y^{5} Z^{2} + 8 X^{2} Y^{3} Z^{4} + 9 X Y^{7} Z + 7 X Y^{6} Z^{2} + X^{4} Y^{2} Z^{2} + 3 X^{3} Y^{3} Z^{2} + X^{2} Y^{5} Z + 54 X^{2} Y^{4} Z^{2} + 42 X^{2} Y^{2} Z^{4} + 4 X Y^{3} Z^{4} + 19 X^{3} Y^{3} Z + 2 X^{2} Y^{4} Z + 88 X^{2} Y^{3} Z^{2} + 5 X Y^{5} Z + 5 X Y^{4} Z^{2} + 6 X Y^{3} Z^{3} + 3 X Y^{2} Z^{4} + 6 X^{3} Y^{2} Z + 2 X^{3} Y Z^{2} + 13 X^{2} Y^{3} Z + 107 X^{2} Y^{2} Z^{2} + 29 X Y^{4} Z + 59 X Y^{3} Z^{2} + 4 X Y^{2} Z^{3} + 3 X Y Z^{4} + 18 X^{3} Y Z + 30 X^{2} Y^{2} Z + 8 X^{2} Y Z^{2} + 68 X Y^{3} Z + 38 X Y^{2} Z^{2} + 4 X Y Z^{3} + 17 X^{2} Y Z + 61 X Y^{2} Z + 70 X Y Z^{2} + 57 X Y Z

Algorithm definition

The algorithm ⟨10×11×15:1050⟩ 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