An improved bound for the de Bruijn–Newman constant

An improved bound for the de Bruijn–Newman constant

The Riemann hypothesis is equivalent to the conjecture that the de Bruijn–Newman constant Λ satisfies Λ≤0. However, so far all the bounds that have been proved for Λ go in the other direction, and provide support for the conjecture of Newman that Λ≥0. This paper shows how to improve previous lower b...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Numerical algorithms 2000-01, Vol.25 (1-4), p.293-303
1. Verfasser: Odlyzko, A.M
Format: Artikel
Sprache:eng
Schlagworte:
Hypotheses
Lower bounds
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The Riemann hypothesis is equivalent to the conjecture that the de Bruijn–Newman constant Λ satisfies Λ≤0. However, so far all the bounds that have been proved for Λ go in the other direction, and provide support for the conjecture of Newman that Λ≥0. This paper shows how to improve previous lower bounds and prove that −2.7⋅10−9
ISSN:1017-1398
1572-9265
DOI:10.1023/A:1016677511798