Documentary state: DRAFT_UNACCEPTED. This draft has NOT been editorially admitted. Mathematical claims require independent checking.
OAI-26 family 108: a claimed cubic lower bound for border determinantal complexity
Editorial status: DRAFT_UNACCEPTED. NO_CERTIFICATION. This source-pinned account describes the publisher's claim and does not independently verify its proof.
The question in plain language
The determinant and permanent both combine products of entries of a square matrix. The determinant attaches alternating signs to these products; the permanent does not. The determinant is efficiently computable, whereas computing a permanent is a central counting-complexity problem.
Determinantal complexity asks how large a matrix of affine-linear forms must be before its determinant can equal the permanent polynomial. Border determinantal complexity also permits limits of such determinant polynomials. Family 108 claims that even with this greater freedom, an \(n\times n\) permanent requires a determinant matrix with size at least cubic in \(n\).
A small example
For the matrix with first row \(a,b\) and second row \(c,d\), its determinant is \(ad-bc\), whereas its permanent is \(ad+bc\). Affine-linear substitutions inside larger determinants can generate polynomials with quite different appearances.
A border representation is more permissive: take determinants of affine-linear matrices in a sequence and ask whether their polynomial coefficients approach those of the permanent. An argument ruling out exact formulas may fail to rule out these limits. The claimed theorem covers the stronger border setting.
What is known
The protected Family 108 catalogue lists one manuscript, A cubic lower bound for border determinantal complexity of the permanent.
The pinned publisher overview claims, over \(\mathbb C\), that
for an absolute \(c>0\) and every sufficiently large integer \(n\). Here the left-hand quantity is the smallest determinant matrix size when coefficientwise limits of determinants of matrices of affine-linear forms are permitted.
An exact representation is a special case of a border representation. Therefore any valid border lower bound also applies to exact determinantal complexity. The reverse inference does not follow.
The claimed cubic bound is not an exponential circuit lower bound, not a proof of \(\mathsf P\ne\mathsf{NP}\), and not automatically valid over every field or for unrestricted arithmetic circuit models.
GCL verification state
Source lock: openai/math@1581d4cbdd69a0faf34b2089614fe2a814316a6a. The source-pinned overview gives the asymptotic exponent, ambient field, affine-linear model, and allowance for coefficientwise limiting representations.
This documentary pass has not checked the manuscript's argument, its closure and degeneration semantics, or the quantitative derivation of the exponent. No Family 108-specific source-critical proof audit, formal elaboration, Comparator replay, or MATHCERT certificate is asserted.
What remains
Read the pinned PDF and extract the exact theorem, the definition of border complexity, and the topology or algebraic closure defining permissible limits. Check dependencies on the approximation parameter and the quantifier order for matrix size, \(c\), and \(n\).
Reconstruct the lower-bound obstruction and show why it persists under coefficientwise limits. Recheck each geometric or algebraic invariant, the dimension estimates, field restrictions, and exceptional small cases.
Complete mathematical Markdown and MkDocs regression, source-critical editorial review, and protected merge/readback. Documentary admission alone is not mathematical certification.
Sources and claim boundaries
Boundary: NO_CERTIFICATION. The cubic lower bound is a publisher-reported claim awaiting independent proof verification.
Indexed primary manuscript paths:
- A cubic lower bound for border determinantal complexity of the permanent —
preprints/A-cubic-lower-bound-for-border-determinantal-complexity-of-the-permanent-September-24-2026/A-cubic-lower-bound-for-border-determinantal-complexity-of-the-permanent-September-24-2026.pdf