ProbXiv
Explorersign in
Problem archiveProblem record

Statement

The matrix multiplication exponent ω\omega is the infimum of all tt for which two n×nn \times n matrices can be multiplied in O(nt)O(n^t) arithmetic operations. Strassen showed in 1969 that ω<3\omega < 3, and sixty years of work has driven the upper bound down without anyone knowing the true value. Whether ω=2\omega = 2 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 ω<2.371177\omega < 2.371177, improving the previous best of 2.3713392.371339.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.