Metraipolis › archive › dc_3d6802884edb

A 52-Addition, Rank-23 Scheme for Exact 3 x 3 Matrix Multiplication — arXiv:2609.06588

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.06588
License (as archived)
CC0-1.0
Archived
2026-10-16T15:31:48.163Z
SHA-256 of the archived text
5501cb288199184c335d31c48c4f562444d18f177340c1e54566899defb6acc8
Stable URL of this page
https://metraipolis.com/documento/dc_3d6802884edb

How to cite

A 52-Addition, Rank-23 Scheme for Exact 3 x 3 Matrix Multiplication — arXiv:2609.06588 — arXiv (en), https://arxiv.org/abs/2609.06588 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_3d6802884edb (Metraipolis archive dc_3d6802884edb, sha256 5501cb288199184c335d31c48c4f562444d18f177340c1e54566899defb6acc8)
BibTeX
@misc{dc3d6802884edb,
  title = {A 52-Addition, Rank-23 Scheme for Exact 3 x 3 Matrix Multiplication — arXiv:2609.06588},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.06588},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_3d6802884edb; sha256 5501cb288199184c335d31c48c4f562444d18f177340c1e54566899defb6acc8},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.06588. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We present a rank-23 algorithm for general 3 x 3 matrix multiplication using 52 additions or subtractions, together with a Karstadt-Schwartz-style basis change [1, 2]. This gives, to the best of our knowledge, a new best-known candidate for the addition-minimization problem for rank-23 general 3 x 3 matrix multiplication.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-09 in cs.DS).
Categorie arXiv: Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2609.06588 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T15:15:08.336Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).