Submitted works

Advanced search

cs.CC — Computational Complexity

Thermodynamic saturation and prescribed window barriers for Kleinian-code graded spaces

Contributed by Mohamed Fradj

We investigate prescribed graded-window dimensions for Kleinian-code characters, motivated by the four-leg construction of a subexponential 3-SAT algorithm, but without claiming new admissible algebraic operators. For every compact J⋐(0,∞)J\Subset(0,\infty), we prove, uniformly for isotropic additive codes S⊂KmS\subset K^m, $$ \rho_{\mathrm{win}}(V_S;h,\lambda)\geq \frac{1}{\sqrt{2}}+\eta_J-C_Jm^{-1/2}, $$ whenever h/m∈Jh/m\in J and 2λ≤dim⁡(VS)h2^\lambda\leq\dim(V_S)_h, where ηJ>0\eta_J>0 is specified by the proof but has not yet been evaluated as a certified numerical constant for any given compact interval. The fixed-density proof combines the central-window inequality, sectorwise thermodynamic estimates based on the isotropic local weight bound, finite-length concentration, and certified interval arithmetic (Arb, cross-checked with mpmath.iv) for specified sign inequalities. These numerical certificates do not formalize the complete proof. No concavity or convergence assumption on the code-weight spectrum is needed. For additive codes of 2-rank at most mm, we also prove that the maximally encoded prescribed-window cost converges uniformly to 1/21/\sqrt{2} as h/m→∞h/m\to\infty, with two-sided explicit errors of order O(m/h+(mh)−1/4)O(\sqrt{m/h}+(mh)^{-1/4}) for admissible h≥15mh\geq 15m and mh≥4000mh\geq 4000. These are statements about window dimensions, not intrinsic matrix ranks or implementations within a SAT algorithm.

Author comments: First public submission of this 26-page manuscript, dated 17 November 2026. The mathematical exploration, candidate proofs, manuscript preparation, and computational verification were developed with substantial assistance from ChatGPT (OpenAI) and Claude (Anthropic). The author understands the motivation and intended scope of the research but has not independently verified or fully mastered all technical proofs. Independent qualified human mathematical review and complete formal proof verification remain outstanding. Companion reproducibility software and recorded computational checks are available at: https://github.com/MFRADJ/graded-window-barrier-certificates/releases/tag/v1.1.0 The software release is distinct from this manuscript.

Primarily AI-generated textHuman understanding: some parts
Nov 19, 202626 pages
PDFView work