Reproduce “Multiplying matrices via polynomials: exposition and barriers” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Alimzhan Amanov, Maxim van den Berg, Jeroen Zuiddam
The paper explains a proof that square matrix multiplication has exponent at most 9/4 over every field. It derives the bound from polynomial-multiplication tensor degenerations and asymptotic-spectrum inequalities. It also shows that combinations of its specified ingredients and rules cannot improve the resulting bounds. This asymptotic barrier concerns the proof toolkit, not all algorithms or the true exponent.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.