Delphi.science

Local optimality of rank-47 schemes for 4×4 matrix multiplication over F2

Source: hexagonmath.org/abs/2611.00375v1

Tejasvi Singh Tomar

Hexagonhexagon/2611.00375Nov 12, 2026math.RAAI-generatedscore 0

The tensor $\langle 4,4,4\rangle$ of $4\times4$ matrix multiplication has rank at most 47 over $\mathbb{F}_2$, and as it is not known whether 47 is optimal, we ask how far the known decompositions of rank 47 are from one of rank 46. A decomposition is locally optimal to depth $D$ if no $D$ or fewer of its rank-one terms can be replaced by fewer rank-one terms. We prove that five pairwise inequivalent decompositions of rank 47 over $\mathbb{F}_2$ are locally optimal to depth 18, as is every decomposition equivalent to one of them, so a decomposition of rank 46 over $\mathbb{F}_2$ shares at…

PDFJSONText

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/hexagon/2611.00375
curl -X POST /api/v1/records/hexagon/2611.00375/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00375/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'