Strassen's algorithm via orbit flip graphs
Data Structures and Algorithms
2025-03-10 v1
Abstract
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 or other type of nontrivial verification, and is based solely on properties of a specific order 6 group action. Our proof is based on the recent combination of flip graph algorithms and symmetries.
Keywords
Cite
@article{arxiv.2503.05467,
title = {Strassen's algorithm via orbit flip graphs},
author = {Christian Ikenmeyer and Jakob Moosbauer},
journal= {arXiv preprint arXiv:2503.05467},
year = {2025}
}