Consequences of the Moosbauer-Poole Algorithms
Symbolic Computation
2025-05-12 v1
Abstract
Moosbauer and Poole have recently shown that the multiplication of two matrices requires no more than 93 multiplications in the (possibly non-commutative) coefficient ring, and that the multiplication of two matrices requires no more than 153 multiplications. Taking these multiplication schemes as starting points, we found improved matrix multiplication schemes for various rectangular matrix formats using a flip graph search.
Keywords
Cite
@article{arxiv.2505.05896,
title = {Consequences of the Moosbauer-Poole Algorithms},
author = {Manuel Kauers and Isaac Wood},
journal= {arXiv preprint arXiv:2505.05896},
year = {2025}
}