Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.30054

Multiplying matrices via polynomials: exposition and barriers

Alimzhan Amanov·Maxim van den Berg·Jeroen Zuiddam
View original source ↗Read source document ↗Export metadata ↓

Abstract

We give an exposition of OpenAI's recent proof that the exponent $ω_\mathbb{C}$ of matrix multiplication over the complex numbers satisfies $ω_\mathbb{C}\leq9/4$. Our version of the proof gives $ω_\mathbb{F}\leq9/4$ over every field $\mathbb{F}$. We also treat the rectangular matrix multiplication exponent $ω_\mathbb{F}(a,b,c)$. Here we have $ω_\mathbb{F}(1,k,1)=2$ for $0\leq k\leq1/2$ and $ω_\mathbb{F}(1,k,1)\leq1+k+1/(4k)$ for $k\geq1/2$, and, for real numbers $a\geq b\geq c\geq0$, $ω_\mathbb{F}(a,b,c)=a+b$ if $c(a+b)\leq ab$ and $ω_\mathbb{F}(a,b,c)\leq(a+b+c)/2+(ab/c+ac/b+bc/a)/4$ otherwise. Our exposition is in the language of degeneration inequalities among polynomial multiplication tensors and Strassen's asymptotic spectrum duality. We moreover prove an operational barrier (which can be thought of as coming from an operational asymptotic spectrum) showing that the current analysis of all these upper bounds on $ω_\mathbb{F}$ and $ω_\mathbb{F}(a,b,c)$ is optimal and that in fact the current degeneration ingredients cannot improve the bounds.

Explore related subjects

cs.CCmath.RAmath.RT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alimzhan Amanov, Maxim van den Berg, Jeroen Zuiddam. 2026-10-21. Multiplying matrices via polynomials: exposition and barriers. https://arxiv.org/abs/2610.30054

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

KEEP EXPLORING

Related papers

arXiv2026

Condensing and Extracting Against Online Adversaries

We study the tasks of deterministically condensing and extracting from Online Non-Oblivious Symbol Fixing (oNOSF) sources, a natural model of defective randomness where extraction is impossible in many parameter regimes [AORSV, EUROCRYPT'20]. A $(g,\ell)$-oNOSF source is a sequence of $\ell$ blocks where at least $g$ blocks are good (independent, with min-entropy) and the remaining bad blocks are controlled by an online adversary and can be arbitrarily correlated with prior blocks. Previously, [CGR, FOCS'24] proved impossibility of condensing beyond rate $1/2$ when $g\le 0.5 \ell$ and showed existence of condensers for when $g \ge 0.51\ell$ and $n$ is exponential in $\ell$. In this work, not only do we construct the first explicit condensers matching the existential results of [CGR, FOCS'24], but we make a doubly exponential improvement by handling the case when $g\ge 0.51\ell$ and $n$ is only polylogarithmic in $\ell$. We also obtain a much improved explicit construction for transforming low-entropy oNOSF sources into uniform oNOSF sources. Next, we essentially resolve the question of the existence of condensers for oNOSF sources by showing the existence of condensers even when $n$ is a large enough constant and $\ell$ is growing (provided $g \ge 0.51\ell$). We apply our condensers to collective coin flipping and collective sampling, widely studied problems in fault-tolerant distributed computing, and provide very simple protocols for them. Finally, we study the possibility of extraction from oNOSF sources. For lower bounds, we introduce the notion of online influence - extending the notion of influence of boolean functions - and establish tight bounds that imply extraction lower bounds. We also construct explicit extractors via leader election protocols that beat standard resilient functions [AL, Combinatorica'93].

cs.CC↗
arXiv2026

High Precision Multiplicative-Error Approximation of $\#$SAC$^1$ Functions in Logspace Uniform AC$^1$

Cheng and Wang (CCC' 24) showed that BPL is contained in logspace uniform AC$^1$ (denoted as L-AC$^1$). We upgrade their result by showing that approximations of $\#$SAC$^1$ functions can be computed in L-AC$^1$ with multiplicative error $2^{-\mathrm{poly}\log n}$. Previously, approximations of $\#$SAC$^1$ functions are known to be in $\mathsf{NC}^2$ via its exact computation given by Vinay (CCC' 91). A main corollary of our result is that Probabilisitic polynomial time logspace AuxPDMs and Read-$k$ logspace PTMs are computable by L-AC$^1$ with multiplicative error $2^{-\mathrm{poly}\log n}$. Notice that multiplicative error approximations are stronger than additive error approximations in the sense that they can be used to decide both non-deterministic computations and two-sided error probabilistic computations. We note that recently OpenAI announced that BPL $=$ L. Even if we only consider derandomizing probabilistic logspace, our L-AC$^1$ computation has the advantage that the error can be $2^{-\mathrm{poly}\log n}$ and can be multiplicative.

cs.CC↗
arXiv2026

Zero Knowledge for Free up to Linear Query Bounds: Quasilinear-Size Constant-Query Zero-Knowledge PCPs

We show that for all polynomials $T$ and $b$, every relation in NTIME($T$) has a binary PCP with $O(1)$ non-adaptive queries, perfect completeness, soundness error 1/2 and length $(T+b)\cdot(\log(T+b))^{O(1)}$, which is perfect zero knowledge against every adaptive, possibly malicious verifier making at most $b$ queries. This improves the length $\tilde O(T+b^2)$ of Zeilberger, O'Connor, Gur and Spooner (2026), who observed that Dinur's gap amplification preserves zero knowledge. The simulator runs in expected polynomial time (or in strict polynomial time, with a failure symbol or with negligible statistical error). For $b\le T$ the length is $T\cdot\mathrm{polylog}\,T$, the form of the shortest known constant-query PCPs without zero knowledge. Unless NP $\subseteq$ BPP, the dependence on $b$ is optimal up to the polylogarithmic factor for polynomial-time simulators: zero knowledge is free up to linear query bounds. Zero-knowledge interactive oracle proofs achieved length $\tilde O(T+b)$ in 2016-17; we obtain it for PCPs. Gur, O'Connor and Spooner (STOC 2025) asked whether NP has such PCPs of quasilinear length (their Open Problem 1). This paper answers it for every polynomial query bound, with the simulators above in place of a strict polynomial-time perfect simulator. The proofs were developed with extensive AI assistance and have been checked by the authors. We mask the Reed-Solomon proof of proximity of Ben-Sasson and Sudan at every node of its recursion. By a locator lemma, at every node, whatever $k$ of its proof symbols reveal about its input is determined by $O(k)$ input values. We prove it with the coprime-order argument of Bafna and Vyas (2026); our treatment of domain points is new. Dinur's gap amplification gives constant query complexity. The query count and the polylogarithmic exponent are absolute but very large.

cs.CC↗