The Matrix Multiplication Exponent
Statement
The matrix multiplication exponent is the infimum of all for which two matrices can be multiplied in arithmetic operations. Strassen showed in 1969 that , and sixty years of work has driven the upper bound down without anyone knowing the true value. Whether is one of the central open questions of algebraic complexity.
The current bounds come from the laser method as refined by combination loss analysis. This paper attacks the optimization problem at the core of that refinement, reformulating it so it can be solved in a larger setting, designing a new optimization algorithm for it, and then refining that algorithm with AlphaEvolve.
The result is , improving the previous best of .
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.