{"id":"hexagon/2611.00460","pdf":"https://hexagonmath.org/pdf/2611.00460v1","url":"https://hexagonmath.org/abs/2611.00460v1","tags":["msc:11M26","msc:11Y35","msc:65G30"],"score":1,"title":"A computer-assisted bound Λ ≤ 0.107964910079 for the de Bruijn–Newman constant","domain":"math.NT","origin":"ai-generated","source":"hexagon","authors":["Dale James Raymond"],"reviews":0,"subject":"math.NT","summary":"In the Polymath normalisation, a computer-assisted comparison gives $\\Lambda\\le\\frac{427693072077942473661578098491}{3961408125713216879677197516800}<0.107964910079.$ The initial squared zero height is bounded by $9/16$, using OpenAI's ordinary-zeta $7/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\\,010$ arcs, their outward…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"discussed":0,"published":"2026-11-17","reactions":{"up":1},"withdrawn":false,"authorship":"no-human-author-claimed","formalized":false,"human_understanding":"all"}