Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.14263

Bipartite Carrier Compression and Machine-Certified Bounds in Schönhage Trilinear Multiplication Tensors

Volkan Dağlı·Zerrin Dağlı·Dağhan Dağlı
View original source ↗Read source document ↗Export metadata ↓

Abstract

Under the conditional framework breaking the longstanding O(n log n) integer multiplication barrier (originating from OpenAI Preprint #109), the asymptotic time complexity exponent T(n) = O(n (log n)^{1-κ}) is governed by bounding the second moment E[X^2] < 1 of recursive branching processes over trilinear tensor carrier graphs. In this work, we present a constructive combinatorial optimization over the alternating carrier bipartite matching graphs of the Schönhage trilinear tensor decomposition at dimensions h=23 and h=25. Through an alternating augmenting path search, we uncover a non-trivial cluster-unlocking cascade that eliminates 185 carrier roles (95 roles in h=23 and 90 roles in h=25), reducing the global physical wire width by 377,890 wires from the reviewed baseline W = 177,284,805 down to W = 176,906,915. Evaluated over the exact 10^{-14} rational grid, this wire reduction certifies an improved second-moment coefficient AB = 5,164,059 / 125,000,000,000 and establishes the sharpened conditional exponent κ= 826,215,307 / 20,000,000,000,000 \approx 4.131076535 \times 10^{-5}, strictly surpassing the preceding record on this architecture (κ\approx 4.123864 \times 10^{-5}). All 47 polynomial constraints and 7 rational security margins are audited in exact Q-arithmetic with zero floating-point error, and the fundamental wire reduction identity is formally verified in the Lean 4 interactive theorem prover without unproven axioms.

Explore related subjects

cs.CCcs.DSmath.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Volkan Dağlı, Zerrin Dağlı, Dağhan Dağlı. 2026-10-09. Bipartite Carrier Compression and Machine-Certified Bounds in Schönhage Trilinear Multiplication Tensors. https://arxiv.org/abs/2610.14263

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

KEEP EXPLORING

Related papers

arXiv2026

Conormal Lower Bounds for Determinantal Complexity: Fermat Slices, Tight Bounds, and a Ceiling

The determinantal complexity of a polynomial $f$ is the smallest size of a matrix of affine linear forms whose determinant is $f$; the border version only asks for determinants converging to $f$. The polar method bounds these quantities from below by comparing an invariant of the hypersurface $V(f)$, such as the degree of its dual variety, with the number of solutions of a polynomial system built from a determinantal representation of $f$. We determine how far the method reaches. Lower bounds: if $f$ has a linear restriction to a form of degree $d$ in $N$ variables with smooth projective zero set, then the border determinantal complexity of $f$ is at least $(N-1)(d-1)/(4e)$. Setting the off-diagonal host entries to zero turns every homomorphism polynomial $\hom_{F,q}$ with a connected pattern $F$ into a Fermat polynomial, which gives the bound $(q-1)(|E(F)|-1)/(4e)$. For the VBP-complete path family $W_q$ this is tight: the border determinantal complexity of $W_q$ is $Θ(q^3)$. The same argument gives cubic bounds for natural VP- and VNP-complete families, and a bound in terms of the codimension of the singular locus of $V(f)$. A ceiling: the method, together with every refinement in a precisely defined class, cannot prove a lower bound larger than $O(dN)$ for any polynomial of degree $d$ in $N$ variables. The proof computes the solution count exactly, as the degree of the dual of a generic determinantal hypersurface, and shows that every characteristic-cycle invariant of a hypersurface of degree $d$ is at most $8(d-1)^{N-1}+8N$. For the $n\times n$ permanent the ceiling is $O(n^3)$; for the power sum $x_1^N+\dots+x_N^N$ it is $(1+o(1))N^2/(4e)$, matching the known lower bound.

cs.CC↗
arXiv2026

Lettericity Is NP-Complete

The lettericity of a graph $G$ is the smallest size of a set $Σ$ such that there exist $w_1, \ldots, w_{|V(G)|} \in Σ$ and a so-called decoder $D \subseteq Σ^2$ for which $G$ is isomorphic to the letter graph $(\{1, \ldots, |V(G)|\}, \{ij : 1 \le i < j \le |V(G)|, w_iw_j \in D\})$. It took around two decades of the study of lettericity for, in the simpler case of paths, a closed-form expression for its lettericity to be derived; this suggests that the question of whether the lettericity of an arbitrary graph can be computed in polynomial time is nontrivial. Indeed, this question has been raised repeatedly as an open problem in recent literature. We solve this problem by showing that the lettericity problem on arbitrary graphs is NP-complete. We also show that each of the natural ways in which a single part of a structure $(Σ, w_1, \ldots, w_{|V(G)|}, D)$ witnessing the lettericity could be constrained corresponds to an NP-complete problem, which resolves an additional three open problems from the literature; in particular, we show that the coloring extension, word extension, and decoder extension problems are NP-complete. Additionally, we use the reduction in the NP-completeness proof to give a lower bound on algorithms for lettericity under the Exponential Time Hypothesis (ETH): unless the ETH is false, there cannot exist a deterministic algorithm to decide whether the lettericity of an $n$-vertex graph is at most $k$ in time $2^{o(n)}$, even when $n = 6k$. Finally, we complement the known result that Lettericity is fixed-parameter tractable when parameterized by the standard parameter $k$ by providing a fixed-parameter algorithm with respect to the dual parameterization by $n-k$ running in $2^{\mathcal{O}((n-k)^2)} + \mathcal{O}(n)$ time.

cs.CC↗
arXiv2026

The Two-Level Poset Game is PSPACE-Complete

Poset games form a fundamental class of combinatorial games that includes classical games such as Nim and Chomp. Determining the outcome of a poset game is known to be PSPACE-complete even for posets of height at most three. However, the exact computational complexity of Two-Level Poset Game, played on posets of height at most two, has remained an open problem for over a decade. We resolve this problem by proving that Two-Level Poset Game is PSPACE-complete via a polynomial-time reduction from Avoid True on positive CNF formulas.

cs.CC↗