Description of fast matrix multiplication algorithm: ⟨13×14×16:1800⟩

Algorithm type

6 X^{4} Y^{6} Z^{7} + 18 X^{4} Y^{6} Z^{6} + 3 X^{4} Y^{4} Z^{7} + 12 X^{4} Y^{6} Z^{4} + 27 X^{4} Y^{4} Z^{6} + 4 X^{2} Y^{8} Z^{4} + 6 X^{4} Y^{4} Z^{5} + X^{2} Y^{8} Z^{3} + 54 X^{4} Y^{4} Z^{4} + 9 X^{4} Y^{2} Z^{6} + 7 X^{2} Y^{8} Z^{2} + 48 X^{2} Y^{6} Z^{4} + 6 X^{2} Y^{3} Z^{7} + 21 X^{2} Y^{2} Z^{8} + 3 X^{4} Y^{2} Z^{5} + 3 X^{2} Y^{6} Z^{3} + 6 X^{2} Y^{3} Z^{6} + 28 X^{2} Y^{2} Z^{7} + 24 X^{4} Y^{2} Z^{4} + 21 X^{2} Y^{6} Z^{2} + 30 X^{2} Y^{4} Z^{4} + 6 X^{2} Y^{3} Z^{5} + 31 X^{2} Y^{2} Z^{6} + 6 X^{2} Y Z^{7} + 4 X Y Z^{8} + 6 X^{2} Y^{4} Z^{3} + 24 X^{2} Y^{3} Z^{4} + 131 X^{2} Y^{2} Z^{5} + 6 X^{2} Y Z^{6} + 4 X Y^{4} Z^{4} + 4 X Y Z^{7} + 36 X^{2} Y^{4} Z^{2} + 145 X^{2} Y^{2} Z^{4} + 24 X^{2} Y Z^{5} + 6 X Y^{4} Z^{3} + 36 X Y^{3} Z^{4} + 3 X Y Z^{6} + 18 X^{2} Y^{3} Z^{2} + 3 X^{2} Y^{2} Z^{3} + 64 X^{2} Y Z^{4} + 30 X Y^{3} Z^{3} + 95 X Y^{2} Z^{4} + 14 X Y Z^{5} + 123 X^{2} Y^{2} Z^{2} + 5 X^{2} Y Z^{3} + 10 X Y^{4} Z + 17 X Y^{2} Z^{3} + 178 X Y Z^{4} + 17 X^{2} Y Z^{2} + 54 X Y^{3} Z + 11 X Y^{2} Z^{2} + 48 X Y Z^{3} + 26 X^{2} Y Z + 85 X Y^{2} Z + 27 X Y Z^{2} + 166 X Y Z

Algorithm definition

The algorithm ⟨13×14×16:1800⟩ 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