Consequences of the Moosbauer-Poole Algorithms
Abstract
Moosbauer and Poole have recently shown that the multiplication of two 5× 5 matrices requires no more than 93 multiplications in the (possibly non-commutative) coefficient ring, and that the multiplication of two 6× 6 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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.