A conditional bound for the de Bruijn--Newman constant
Cetin Hakimoglu-Brown
Source abstract
Assuming that has no nontrivial zero with , as asserted in a recent unrefereed preprint of OpenAI, we obtain for the de Bruijn-Newman constant. A published Polymath boundary computation supplies a finite-region strip of half-width . We derive an approximation on from its general Riemann-Siegel coefficient bounds. At height , a fixed cutoff permits two differentiations, and comparison with bounds both the zero-density kernel and its vertical derivative. A new conjugate-pair inequality and a twenty-four-step strip comparison give the stated bound. The finite scalar and polynomial certificates are included in the paper; earlier comparisons giving , , and are retained to show the source of the gain. The argument uses neither Gordon's analytic inputs nor Gomila's new computations. The seven-eighths hypothesis remains an assumption, and the published numerical boundary input is retained.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.