The de Bruijn-Newman constant is the real number such
that the function
defined below has only real
zeros if and only if
. Let
be the xi-function defined
by
|
(1)
|
can be viewed as the Fourier transform of the
signal
|
(2)
|
for ,
.
Then denote the Fourier transform of
as
,
|
(3)
|
Newman (1976) proved that such a constant exists and conjectured that . The Riemann
hypothesis is equivalent to the conjecture that
, so Newman's conjecture asserts that the Riemann
hypothesis, if true, is only barely true. The following table summarizes best
known lower bounds on
prior to 2020, when Rodgers and Tao (2020) proved that
.
| lower bound | reference |
| Newman (1976) | |
| Csordas-Norfolk-Varga (1988) | |
| te Riele (1991) | |
| Norfolk-Ruttan-Varga (1992) | |
| Csordas-Ruttan-Varga (1991) | |
| Csordas-Smith-Varga (1994) | |
| Csordas-Odlyzko-Smith-Varga (1993) | |
| Odlyzko (2000) | |
| Saouter-Gourdon-Demichel (2011) |
Upper bounds on are summarized below. The final three rows are computer-assisted
bounds reported in 2026 that had not undergone external peer review as of Sep. 15,
2026.
| upper bound | reference | status |
| de Bruijn (1950) | published | |
| Ki-Kim-Lee (2009) | published | |
| Polymath (2019) | published | |
| Platt-Trudgian (2021) | published | |
| Mosaic Intelligence (2026) | unreviewed | |
| Gomila (2026) | unreviewed | |
| Gordon (2026) | unreviewed |
Mosaic Intelligence (2026) describes its bound as AI-generated. Gomila (2026) reports human-directed work using Claude and ChatGPT/Codex, while Gordon (2026) reports assistance from GPT-6 Astra and Claude Code. The Mosaic Intelligence and Gomila projects provide numerical certificates. Gordon's partial Lean formalization is conditional on stated analytic inputs.