Answers are grounded in this paper and cite their sources.
Mathematical proof demonstrates an upper limit for the de Bruijn–Newman constant, impacting number theory implications.
For t ∈ ℝ let H_t(z) = ∫₀^∞ etu²Φ(u)cos(zu)du, where Φ is the classical Riemann–Jacobi kernel, and let Λ be the de Bruijn–Newman constant. We prove Λ ≤ 0.1811918082. The proof applies the zero-exclusion criterion of D. H. J. Polymath at (t₀, y₀) = (0.171192, 0.14142) and the barrier centre X₀ = 6,000,284,561,421, discharged by four outward-rounded certificate components. C1's binding first interval is certified at intrinsic (exact-functional) grade — a two-sided limit-envelope result, with the coarse one-sided mesh at that interval explicitly failing and explicitly not consumed — with reserve exceeding 1.13010×10⁻⁴; the remaining three intervals carry direct margins exceeding 0.271, 0.467, and 0.544. C2 gives a monotone large-N tail reserve exceeding 0.0310648 at N₁ = 25,000,000. C3 requires no new computation: the needed barrier region is a literal subset of the previously certified closed rectangle [X, X+1] × [0.14142, 1], 0 ≤ t ≤ 0.18, whose weakest homotopy reserve exceeds 0.0477467585, with equality at the y-boundary permitted because the certified rectangle is stated with inclusive inequalities. C4 regenerates the final-time edges from a fresh 65,537-point outward scan at t₀ = 0.171192. Every production certificate uses the conservative 1.03 chirality constant. The complete certificate chain has additionally survived a clean-room source-level reproduction (§14). Six earlier parameter instances — Λ ≤ 0.1814998082, 0.181582, 0.1828, 0.188, 0.189, and 0.1899998082 — are retained as independent full-architecture validation appendices. The methodology section documents the parametrized ladder by which the terminal pair was selected, including the certified two-sided intrinsic feasibility frontier of the boundary column. A separate section proves that this certificate architecture possesses a positive algebraic floor: no instance of the family can certify Λ ≤ 0, so the paper is self-delimiting. The theorem is a quantitative upper bound for Λ and is not a proof of the Riemann hypothesis. Author: Daniel Martin Kornaus, Independent Researcher, no institutional affiliation. The complete reproducibility and computational certificate archive accompanying this preprint has SHA-256: fcd08cd56712bed0895a5f33f5bfb6998a2f7bfa7563ea55234709a24aa2037e The release contains the proof-critical computational certificates, source code, verification scripts, clean-room reproduction materials, original and independently regenerated C3 barrier records, SHA-256 manifests, and portable replay tooling. This is a preprint released for independent mathematical verification and peer review.
No takes yet. Share an insight, caveat, or question.
Daniel Martin Kornaus (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: