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

Primarily AI-generated textHuman understanding: some partscs.CC — Computational Complexity

Contributed by Mohamed Fradj ↗

Version 1 / Nov 19, 2026 / CC BY 4.0

Abstract

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.

Provenance statement

This research was conducted through an author-directed process with substantial assistance from ChatGPT (OpenAI) and Claude (Anthropic). AI systems contributed extensively to mathematical exploration, candidate proofs, manuscript drafting, software development, numerical verification, and critical examination of arguments. The human author initiated and directed the research, selected the questions and research directions, organized the results, and coordinated computational testing. Human understanding and verification are partial. The complete mathematical arguments have not yet undergone independent qualified human peer review or formal proof-assistant verification. Computational reproduction materials are publicly available at: https://github.com/MFRADJ/graded-window-barrier-certificates/releases/tag/v1.1.0 The author takes responsibility for the submission and does not claim that the computational checks constitute a complete proof verification.

References

  1. R. Impagliazzo and R. Paturi, On the complexity of kk-SAT , J. Comput. System Sci. 62 (2001), 367--375.
  2. R. Impagliazzo, R. Paturi, and F. Zane, Which problems have strongly exponential complexity? , J. Comput. System Sci. 63(4) (2001), 512--530. https://doi.org/10.1006/jcss.2001.1774.DOI
  3. OpenAI, The Exponential Time Hypothesis is False , OpenAI Math Release preprint, revised 25 October 2026. https://github.com/openai/math/tree/main/preprints/The-Exponential-Time-Hypothesis-is-False-October-25-2026.link
  4. Claude (Anthropic), A 2o(n)2^{o(n)} time algorithm for 3-SAT , Hexagon preprint 2610.00577v1 (deposited 27 October 2026). https://hexagonmath.org/2610.00577v1.hexagon
  5. Carlos Stein Naves de Brito, The partition exponent in the graded pieces of the Claude 3-SAT algorithm is optimal for pieces of that shape , Hexagon preprint 2610.00692v1 (31 October 2026). https://hexagonmath.org/2610.00692v1.hexagon
  6. Ruhollah Majdoddin, Lowered crossover points of Anthropic's subexponential 3-SAT algorithm , arXiv:2610.41622v1 (submitted 30 October 2026). https://arxiv.org/abs/2610.41622.arXiv
  7. Vaibhav Tulsyan, What the ETH refutations do not give: barriers for the counting engines, with machine-checked lemmas , Hexagon preprint 2611.00149v1 (6 November 2026). https://hexagonmath.org/2611.00149v1.hexagon
  8. G. H. Hardy and S. Ramanujan, Asymptotic formulae in combinatory analysis , Proc. London Math. Soc. (2) 17 (1918), 75--115.
  9. A. E. Ingham, A Tauberian theorem for partitions , Ann. of Math. (2) 42 (1941), 1075--1090. https://doi.org/10.2307/1970462.DOI
  10. B. Mukhametzhanov and A. Zhiboedov, Modular invariance, tauberian theorems and microcanonical entropy , JHEP 10 (2019), 261. https://doi.org/10.1007/JHEP10(2019)261.DOI
Show all 19 referencesShow fewer references
  1. T. M. Apostol, Modular Functions and Dirichlet Series in Number Theory , 2nd ed., Springer (1990).
  2. A. R. Calderbank, E. M. Rains, P. W. Shor, N. J. A. Sloane, Quantum error correction via codes over GF(4) , IEEE Trans. Inform. Theory 44 (1998), 1369--1387.
  3. J. L. Cardy, Operator content of two-dimensional conformally invariant theories , Nucl. Phys. B 270 (1986), 186--204.
  4. J. H. Conway, N. J. A. Sloane, Sphere Packings, Lattices and Groups , 3rd ed., Springer (1999).
  5. A. Dymarsky and A. Shapere, Quantum stabilizer codes, lattices, and CFTs , JHEP 03 (2021), 160; arXiv:2009.01244. https://doi.org/10.1007/JHEP03(2021)160.arXivDOI
  6. R. S. Ellis, Entropy, Large Deviations, and Statistical Mechanics , Springer (1985).
  7. T. Hartman, C. A. Keller and B. Stoica, Universal spectrum of 2d conformal field theory in the large cc limit , JHEP 09 (2014), 118. https://doi.org/10.1007/JHEP09(2014)118.DOI
  8. G. Höhn, Self-dual codes over the Kleinian four group , Math. Ann. 327 (2003), 227--255; arXiv:math/0005266.arXiv
  9. F. Johansson, Arb: efficient arbitrary-precision midpoint-radius interval arithmetic , IEEE Trans. Computers 66 (2017), 1281--1292.

Version history

  1. v1 · 26 pagesSubmitted by Mohamed FradjFirst 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.CurrentNov 19, 2026