Metraipolis › archive › dc_86442d4e175b

A Lower Bound of 21 for $3\times3$ Matrix Multiplication over $\mathbb{F}_2$ — arXiv:2609.06725

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.06725
License (as archived)
CC0-1.0
Archived
2026-10-16T15:31:54.621Z
SHA-256 of the archived text
607846f39b2f0c7e0f32abf82bb122bc082a18e168e2b5c3853ce231b7518744
Stable URL of this page
https://metraipolis.com/documento/dc_86442d4e175b

How to cite

A Lower Bound of 21 for $3\times3$ Matrix Multiplication over $\mathbb{F}_2$ — arXiv:2609.06725 — arXiv (en), https://arxiv.org/abs/2609.06725 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_86442d4e175b (Metraipolis archive dc_86442d4e175b, sha256 607846f39b2f0c7e0f32abf82bb122bc082a18e168e2b5c3853ce231b7518744)
BibTeX
@misc{dc86442d4e175b,
  title = {A Lower Bound of 21 for $3times3$ Matrix Multiplication over $mathbbF_2$ — arXiv:2609.06725},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.06725},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_86442d4e175b; sha256 607846f39b2f0c7e0f32abf82bb122bc082a18e168e2b5c3853ce231b7518744},
  year = {2026}
}

Archived text

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

We prove that $3\times3$ matrix multiplication over $\mathbb{F}_2$ has bilinear complexity at least $21$, improving the previous lower bound of $20$. Lower bounds for restrictions of the first input constrain how many first factors of a decomposition can lie in each subspace. For a hypothetical $20$-term decomposition, the strengthened restriction bounds force all first factors of matrix rank at least two into a single coset of a three-dimensional rank-one subspace. An exhaustive computation finds no admissible first-factor profile with $20$ terms. We also prove that $2\times3$ by $3\times3$ matrix multiplication over $\mathbb{F}_3$ has rank exactly $15$: three profiles with $14$ terms survive the corresponding computation up to symmetry, and short restriction arguments exclude them. We combine Wang's automated framework for tensor-rank lower bounds with D'Ambrosio's capacity-and-profile strategy. Our computational contributions are rank-one-span searches that strengthen the subspace lower-bound table and a direct, symmetry-reduced profile enumerator that enforces all subspace capacities simultaneously.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-09 in cs.DS).
Categorie arXiv: Computational Complexity (cs.CC) ; Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2609.06725 — 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.358Z 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).