Description of fast matrix multiplication algorithm: ⟨6×15×15:859⟩

Algorithm type

16X3Y15Z2+4X3Y15Z+20X3Y12Z+4X4Y6Z4+48X3Y9Z2+48X2Y9Z3+10X3Y9Z+8XY9Z3+32X4Y4Z4+60X3Y8Z+8X2Y8Z2+44XY8Z3+2X3Y7Z+64X3Y6Z2+48X2Y6Z3+20XY7Z3+26X3Y6Z+3X2Y6Z2+6XY8Z+6XY6Z3+2X4Y3Z2+36X3Y5Z+3X2Y3Z4+50XY5Z3+16X4Y2Z2+34X3Y4Z+24X2Y4Z2+24X2Y2Z4+16XY4Z3+4X2Y4Z+11X2Y3Z2+6XY4Z2+96X2Y2Z2+22XY4Z+4X2YZ+6XY2Z+6XYZ2+22XYZ16X3Y15Z24X3Y15Z20X3Y12Z4X4Y6Z448X3Y9Z248X2Y9Z310X3Y9Z8XY9Z332X4Y4Z460X3Y8Z8X2Y8Z244XY8Z32X3Y7Z64X3Y6Z248X2Y6Z320XY7Z326X3Y6Z3X2Y6Z26XY8Z6XY6Z32X4Y3Z236X3Y5Z3X2Y3Z450XY5Z316X4Y2Z234X3Y4Z24X2Y4Z224X2Y2Z416XY4Z34X2Y4Z11X2Y3Z26XY4Z296X2Y2Z222XY4Z4X2YZ6XY2Z6XYZ222XYZ16*X^3*Y^15*Z^2+4*X^3*Y^15*Z+20*X^3*Y^12*Z+4*X^4*Y^6*Z^4+48*X^3*Y^9*Z^2+48*X^2*Y^9*Z^3+10*X^3*Y^9*Z+8*X*Y^9*Z^3+32*X^4*Y^4*Z^4+60*X^3*Y^8*Z+8*X^2*Y^8*Z^2+44*X*Y^8*Z^3+2*X^3*Y^7*Z+64*X^3*Y^6*Z^2+48*X^2*Y^6*Z^3+20*X*Y^7*Z^3+26*X^3*Y^6*Z+3*X^2*Y^6*Z^2+6*X*Y^8*Z+6*X*Y^6*Z^3+2*X^4*Y^3*Z^2+36*X^3*Y^5*Z+3*X^2*Y^3*Z^4+50*X*Y^5*Z^3+16*X^4*Y^2*Z^2+34*X^3*Y^4*Z+24*X^2*Y^4*Z^2+24*X^2*Y^2*Z^4+16*X*Y^4*Z^3+4*X^2*Y^4*Z+11*X^2*Y^3*Z^2+6*X*Y^4*Z^2+96*X^2*Y^2*Z^2+22*X*Y^4*Z+4*X^2*Y*Z+6*X*Y^2*Z+6*X*Y*Z^2+22*X*Y*Z

Algorithm definition

The algorithm ⟨6×15×15:859⟩ 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