The de Bruijn–Newman constant
Narrow the de Bruijn–Newman constant, which equals 0 exactly when the Riemann hypothesis holds; it is known that 0 ≤ Λ ≤ 0.2.
The de Bruijn–Newman constant
Let the Riemann function evolve under the heat equation: from some time on, all its zeros are real. That threshold is the de Bruijn–Newman constant . The Riemann hypothesis says exactly that ; it is known that , and newer computer-certified claims below 0.2 await independent checking.
Problem
Let
is, up to scaling and a change of variable, the Riemann ξ function, and is essentially its evolution under the heat flow. Newman (1976) proved that there is a finite constant such that all zeros of are real exactly when . Determine , or narrow the bounds .
Background
The Riemann hypothesis is equivalent to . Newman conjectured the complementary bound , and Rodgers and Tao proved it (2020). So the Riemann hypothesis is now equivalent to , and each upper bound measures how close known results come to it. De Bruijn (1950) proved ; Ki, Kim and Lee (2009) made the inequality strict; the Polymath project (2019) reached by combining a careful analysis of the heat flow with numerical verification, and the rigorous verification of the Riemann hypothesis up to height by Platt and Trudgian brought it to .
What is known
- Lower bound: (Rodgers and Tao, 2020), after a long series of negative lower bounds obtained from close pairs of zeta zeros, ending at (Saouter, Gourdon and Demichel, 2011).
- Upper bounds, refereed: (de Bruijn, 1950); strictly below (Ki, Kim and Lee, 2009); (Polymath, 2019); (Platt and Trudgian, 2021).
- Unverified claims (asterisked on the source, all from 2026): certificate packages claim and (Mosaic Intelligence), (Kornaus), and then and (Mosaic Intelligence). They are self-archived and not yet independently replayed, and several of them build on the package.
What would count as progress
- An independent replay of one of the certificate packages, which would turn an unverified bound into an accepted one. Each package comes with certified computations and a bundle intended for replay.
- A new upper bound below (or below the claimed values), with a certificate whose computations are reproducible.
- Theoretical progress that reduces the computation needed for each further step, for example sharper estimates for away from the region checked numerically.
References
- C. M. Newman, "Fourier transforms with only real zeros", Proceedings of the AMS 61 (1976), 245–251. doi:10.1090/s0002-9939-1976-0434982-5
- H. Ki, Y.-O. Kim and J. Lee, "On the de Bruijn–Newman constant", Advances in Mathematics 222 (2009), 281–306. doi:10.1016/j.aim.2009.04.003
- B. Rodgers and T. Tao, "The de Bruijn–Newman constant is non-negative", Forum of Mathematics, Pi 8 (2020). arXiv:1801.05914
- D. H. J. Polymath, "Effective approximation of heat flow evolution of the Riemann ξ function, and a new upper bound for the de Bruijn–Newman constant", Research in the Mathematical Sciences 6 (2019), 31. arXiv:1904.12438
- D. Platt and T. Trudgian, "The Riemann hypothesis is true up to 3·10¹²", Bulletin of the London Mathematical Society 53 (2021), 792–797. doi:10.1112/blms.12460
Source
Imported from Optimization Constants in Mathematics, constant 21, curated by Terence Tao and contributors. Open according to the source as of 2026-10-20. The statement above is written in our own words; see the source for the original wording, history and discussion.