Search arXiv⌕ Search

arXiv · 2611.06245

Certified Collision Exclusion and an Unconditional Upper Bound $Λ<0.156821$ for the de Bruijn--Newman Constant

Abstract

The de Bruijn--Newman constant $Λ$ is the transition time beyond which all zeros of the heat-deformed Riemann $ξ$-function are real. We develop a computer-assisted collision-exclusion method and obtain the bound $Λ<156821/10^6=0.156821$, in the normalisation of Polymath. The proof combines the published finite-height verification and the starting inequality $Λ\leq1/5$ with a compact-interior continuation theorem, five stable prime-polynomial Gram sources, certified moving-index recovery, a balanced real-jet transfer and a uniform Euler-product barrier at infinity. The resulting closed time-band exclusion, together with uniform remote reality, forces strictness at the proposed endpoint. The finite certificate uses 664,505 structural Fourier coefficients, 44,182 closed torus boxes, 184 separator moments and 17,385 separator rectangles. We isolate a Cauchy--Schwarz obstruction intrinsic to the four-prime source family, explaining the narrow feasibility margin of the certified endpoint. We state the proof-to-certificate interface and distinguish the present unconditional logical claim from other recent, as yet unrefereed, computational bounds.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Michel Planat, Dale James Raymond. 2026-11-04. Certified Collision Exclusion and an Unconditional Upper Bound $Λ<0.156821$ for the de Bruijn--Newman Constant. https://arxiv.org/abs/2611.06245

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Arithmetic Upper and Lower Bounds for the Denumerant Function

We use an elementary arithmetic argument, going back to Blom and Fr{ö}berg, to obtain upper and lower bounds for the denumerant function of Sylvester for arbitrary positive integers $a_1,\dots,a_k$. The bounds hold along the multiples of $\gcd(a_1,\dots,a_k)$, share the leading term of the denumerant, and yield its asymptotic behaviour with an explicit error term; for large $n$ and under a mild condition, a polynomial refinement of the lower bound improves on the lower bound of Agnarsson.

math.NT↗

The Riemann hypothesis

The Weyl symbolic calculus of operators leads to the construction, if one takes for symbol a certain distribution decomposing over the zeros of the Riemann zeta function, of an operator with the following property: the Riemann hypothesis is equivalent to the validity of a collection of estimates involving this operator. Pseudodifferential arithmetic, a novel chapter of pseudodifferential operator theory, makes it possible to make the operator under study fully explicit. This leads to a proof of the conjecture.

math.NT↗

On the representation functions of certain numeration systems

Let $β>1$ be fixed. We consider the $(\mathbf{b},\mathcal{D})$-numeration system, where the base sequence $\mathbf{b}=(b_k)_{k\geq 0}$ consists of positive real numbers satisfying $\lim_{k\rightarrow \infty}b_{k+1}/b_k=β$, and the digit set $\mathcal{D}\ni 0$ is a finite set of nonnegative real numbers containing at least two elements. Let $r_{\mathbf{b},\mathcal{D}}(λ)$ denote the number of representations of a given $λ\in\mathbb{R}$ in the form $\sum_{k\ge 0}δ_kb_k$ with digits $δ_k\in \mathcal{D}$. We establish upper bounds for $r_{\mathbf{b},\mathcal{D}}(λ)$ as well as asymptotic formulas for its arbitrary moments. Furthermore, we prove that the associated Dirichlet series $ζ_{\mathbf{b},\mathcal{D}}(s):=\sum_{λ>0}r_{\mathbf{b},\mathcal{D}}(λ)λ^{-s}$ admits a meromorphic continuation to the entire complex plane when $b_k=β^{k}$, and to the half-plane $\mathrm{Re}(s)>\log_β\mathcal{D}-γ$ when $b_k=β^{k}+O(β^{(1-γ)k})$ for any fixed $γ\in(0,1]$. Within the regions of continuation, we determine all candidate poles, compute their corresponding residues, and locate the trivial zeros of $ζ_{\mathbf{b},\mathcal{D}}(s)$. As an application, we resolve several problems posed by Chow and Slattery concerning partitions into distinct terms of certain integer sequences.

math.NT↗