2 papers
cs.DS2025
Strassen's algorithm via orbit flip graphs
Christian Ikenmeyer, Jakob Moosbauer
We give a short proof for Strassen's result that the rank of the 2 by 2 matrix multiplication tensor is at most 7. The proof requires no calculations and also no pattern matching o…
cs.SC2025
Flip Graphs with Symmetry and New Matrix Multiplication Schemes
Jakob Moosbauer, Michael Poole
The flip graph algorithm is a method for discovering new matrix multiplication schemes by following random walks on a graph. We introduce a version of the flip graph algorithm for…