We give a self-contained constructive proof that the matrix multiplication exponent satisfies $\omega\le9/4$. In a recent breakthrough, OpenAI~\cite{original} established this bound in the model of exact scalar arithmetic over the complex numbers, using non-constructive arguments in Strassen's asymptotic spectral framework. We explicitly construct a Strassen-style matrix multiplication identity and obtain the bound by ordinary block recursion. For every $\gamma>0$, the resulting algorithm multiplies two $n\times n$ integer matrices using $O(n^{9/4+\gamma})$ integer arithmetic operations. As an independent contribution, we develop a framework of \emph{polynomial packings}---methods for reducing many polynomial multiplications to fewer ones using linear operations. We isolate and generalize a construction of OpenAI~\cite{original} to obtain a simple packing, and show how packings can be composed to amplify their ``compression rate", which finally yields Strassen-like identities.
We prove an $\Omega(n^2)$ lower bound on the determinantal complexity of the power sum polynomial $\sum_{i=1}^n x_i^n$ over the field of complex numbers. A similar result was claimed in a recent paper of Sheshadri (arXiv:2606.13628), via an AI-assisted and AI-written proof. Assuming its correctness, this was the first...
Mrinal Kumar, Ben Lee Volk· Electron. Colloquium Comput....· 3 citations
We give a computer-assisted proof that the real Grothendieck constant is strictly smaller than $1.77987164$. The proof provides a complete interval-arithmetic realization of Ren's five-variable construction. A finite Fourier calculation encloses every scalar coefficient through degree $403$; a fourth-derivative estimat...
Lee and O'Clarey recently conjectured that every integer $n>24$ can be written as the sum of a prime and a positive integer that is not square-free. They proved this for odd $n$, and for all $n>24$ assuming the generalised Riemann hypothesis for Dirichlet $L$-functions. We prove their conjecture unconditionally for eve...
We give an elementary proof of the absence of Landau--Siegel zeros with the explicit constant $c=1/100$. For every primitive quadratic Dirichlet character $\chi$ of conductor $q\ge3$, each real zero $\beta\in(0,1)$ of $L(s,\chi)$ satisfies $(1-\beta)\log q>c$. The proof combines integer coefficient counting, polynomial...
We combine the universal polynomial matrix identities of Larsen--Nguyen with Trost's arithmetic lemmas to obtain polynomial parametrizations of $\text{SL}_2(\mathcal{O}_{K,S})$ for every global function field $K$ and every nonempty finite set of places $S$. The additional ingredient is a function-field cancellation lem...
The Koml\'os problem asks for signs $\varepsilon\in\{-1,1\}^n$ with $\|A\varepsilon\|_\infty$ bounded by an absolute constant whenever the columns of $A\in\mathbb R^{m\times n}$ have Euclidean norm at most $1$. We give the first polynomial-time algorithm for this problem in the unit-cost real-RAM model. Our determinist...