Submitted works

Advanced search

math.NT — Number Theory

A computer-assisted bound Λ ≤ 0.107964910079 for the de Bruijn–Newman constant

Contributed by Dale James Raymond

In the Polymath normalisation, a computer-assisted comparison gives Λ≤4276930720779424736615780984913961408125713216879677197516800<0.107964910079.\Lambda\le\frac{427693072077942473661578098491}{3961408125713216879677197516800}<0.107964910079. The initial squared zero height is bounded by 9/169/16, using OpenAI's ordinary-zeta 7/87/8 nonvanishing theorem formalised in Lean at the identified source revision. Finite signed translated-probe functionals, matched physical source estimates, and continuous-domain kernel inequalities supply a piecewise comparison for that height. A newly implemented exact rational consumer checks every one of the 221 010221\,010 arcs, their outward rounding and joins, and the complete final de Bruijn contraction. The fifteen-stage finite replay includes a direct reconstruction of all 6767 source chords from their primitive payments, with explicit binding of the main terms and the complete derivative functionals. Separate consumers verify their continuous kernel certificates and the actual physical and arithmetic charges. The analytic argument includes the corrected 11/1211/12 Gaussian remainder, finite-head localisation, attainment of a positive-time highest contact, and repeated complex contacts. The accompanying packet contains the mathematical sources, certificate data, checker programs, exact source identities, and replay instructions. The initial theorem is used at cited-theorem trust with authenticated external Lean-build evidence; a fresh local Lean build and an end-to-end formalisation of the present comparison are not claimed.

Author comments: This submission corresponds to version 1.0, dated 29 October 2026, of the manuscript deposited at https://doi.org/10.5281/zenodo.23752103. Complete computational evidence, verification instructions and component-specific rights notices remain available in that deposit and its companion repository: https://github.com/Dale-Dug/de-bruijn-newman-0107965. Related separate works: Michel Planat and Dale James Raymond, Certified Collision Exclusion and an Unconditional Upper Bound Λ < 0.156821 for the de Bruijn–Newman Constant, https://arxiv.org/abs/2611.06245 (subsequent joint paper); the earlier 0.149396 bound, https://doi.org/10.5281/zenodo.23781981; and the conditional 0.116398 bound, https://doi.org/10.5281/zenodo.23272725. These are separate works, not additional results claimed by this manuscript.

Primarily AI-generated textHuman understanding: all parts
Nov 17, 202663 pages
PDFView work