Open Research Index

Matrix multiplication exponent at most 9/4 over arbitrary fields

Sela Navot

Palomar Registrypalomar/PALOMAR-2026-10-08-000005Oct 8, 2026cs.CCscore 0

This development extends OpenAI's Lean proof of the matrix multiplication exponent bound 9/4 from the complex numbers to every field, including finite fields and fields of positive characteristic. It generalizes Fourier separation and interpolation over each field's algebraic closure, descends tensor powers through one fixed finite coefficient algebra, and connects the resulting exact-rank bounds to the original division-free arithmetic-program model. The compared statements include the arithmetic exponent upper bound, nonvacuity and lower-bound checks, an explicit positive-epsilon…

SourceRepositoryJSON

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/palomar/PALOMAR-2026-10-08-000005
curl -X POST /api/v1/records/palomar/PALOMAR-2026-10-08-000005/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-10-08-000005/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'