A 58-Addition, Rank-23 Scheme for General 3x3 Matrix Multiplication
Abstract
This paper presents a new state-of-the-art algorithm for exact 3×3 matrix multiplication over general non-commutative rings, achieving a rank-23 scheme with only 58 scalar additions. This improves the previous best additive complexity of 60 additions without a change of basis. The result was discovered through an automated search combining ternary-restricted flip-graph exploration with greedy intersection reduction for common subexpression elimination. The resulting scheme uses only coefficients from \-1, 0, 1\, ensuring both efficiency and portability across arbitrary fields. The total scalar operation count is reduced from 83 to 81.
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.