55 Additions Suffice for 3x3 Matrix Multiplication at Rank 23

Samurdhi Karunaratne; Anushka Idamekorala

Home/Archive/arXiv

arXiv · 2607.28676

55 Additions Suffice for 3x3 Matrix Multiplication at Rank 23

Samurdhi Karunaratne·Anushka Idamekorala

View original source ↗Read source document ↗Export metadata ↓

Abstract

We give a 55-addition realization of rank-23 multiplication of two arbitrary $3\times3$ matrices. Together with its 23 bilinear products, the circuit uses 78 scalar operations. This improves the previous state of the art of 56 additions, due to Sun. The construction starts from Perminov's public 58-addition realization cr58_cn122 of a ternary tensor; the contribution is a shorter and, for this fixed orientation of that tensor, provably optimal linear circuit: 13 additions on the left input, 14 on the right input, and 28 at the output. The last circuit is obtained by transposing a 14-addition factor circuit. Because the coefficient alphabet is $\{-1,0,1\}$ and the order of every bilinear product is retained, the algorithm applies over every associative ring, commutative or not. We provide the full straight-line program and tensor factors together with four exact computational checks, including independent Python and Node.js implementations of all 729 Brent identities over $\mathbb Z$.

Explore related subjects

cs.CC

Keep this discovery

BibTeX RIS

Samurdhi Karunaratne, Anushka Idamekorala. 2026-07-28. 55 Additions Suffice for 3x3 Matrix Multiplication at Rank 23. https://arxiv.org/abs/2607.28676

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The Computational Complexity of Holant Problems on 4-regular Graphs from the Stable Subgroup Sequence of $SL(2,\mathbb{C})$

The Holant framework provides a general setting for studying counting problems and includes graph homomorphisms (\#GH) and counting constraint satisfaction problems (\#CSP) as special cases. Over the past twenty years, a series of computational complexity dichotomies have been established for Holant problems, but the classification for complex-valued signatures is still open. The main obstacle is the case in which all signatures have even arity. In this paper, we establish a dichotomy for Holant problems with a complex-valued 4-ary signature, which is a key base case for the full classification of Holant problems. We present a new strategy by introducing Schur's theorem, the classification of finite subgroups of $\mathrm{SL}(2,\mathbb{C})$ and stable subgroup sequences into the proof. These new techniques are of independent interest.

cs.CC↗

arXiv2026

Max Independent Set Remains NP-hard when Excluding a Planar Induced Minor

We show that there is a fixed planar graph $H$, namely the $5 \times 5$ grid, such that Max Independent Set remains NP-hard in $H$-induced-minor-free graphs. This refutes the Dallard--Milani\v{c}--\v{S}torgel conjecture and a weakening of it by Gartland and Lokshtanov, and by Korhonen.

cs.CC↗

arXiv2026

Topology inside NC$^1$

We show that ACC$^0$ is precisely what can be computed with constant-width circuits of polynomial size and polylogarithmic genus. This extends a characterization given by Hansen, showing that planar constant-width circuits also characterize ACC$^0$. Thus polylogarithmic genus provides no additional computational power in this model. We consider other generalizations of planarity, including crossing number and thickness. We show that constant-width circuits of polynomial size and thickness two already suffice to capture all of NC$^1$.

cs.CC↗