Computation and the Riemann Hypothesis: Dedicated to Herman te Riele - - PowerPoint PPT Presentation

▶
computation and the riemann hypothesis dedicated to
SMART_READER_LITE
LIVE PREVIEW

Computation and the Riemann Hypothesis: Dedicated to Herman te Riele - - PowerPoint PPT Presentation

Feb 13, 2023 225 likes •381 views

Computation and the Riemann Hypothesis: Dedicated to Herman te Riele on the occasion of his retirement Andrew Odlyzko School of Mathematics University of Minnesota odlyzko@umn.edu http://www.dtc.umn.edu/ odlyzko December 2, 2011 Andrew

slide-1
SLIDE 1

Computation and the Riemann Hypothesis: Dedicated to Herman te Riele

  • n the occasion of his retirement

Andrew Odlyzko

School of Mathematics University of Minnesota

  • dlyzko@umn.edu

http://www.dtc.umn.edu/∼odlyzko

December 2, 2011

Andrew Odlyzko ( School of Mathematics University of Minnesota odlyzko@umn.edu http://www.dtc.umn.edu/∼odlyzko ) Computation and the Riemann Hypothesis: Dedicated to Herman te Riele on the occasio December 2, 2011 1 / 15

slide-2
SLIDE 2

The mysteries of prime numbers: Mathematicians have tried in vain to discover some order in the sequence of prime numbers but we have every reason to believe that there are some mysteries which the human mind will never penetrate. To convince ourselves, we have only to cast a glance at tables of primes (which some have constructed to values beyond 100,000) and we should perceive that there reigns neither order nor rule. Euler, 1751

Andrew Odlyzko ( School of Mathematics University of Minnesota odlyzko@umn.edu http://www.dtc.umn.edu/∼odlyzko ) Computation and the Riemann Hypothesis: Dedicated to Herman te Riele on the occasio December 2, 2011 2 / 15

slide-3
SLIDE 3

Herman te Riele’s contributions towards elucidating some

  • f the mysteries of primes:

numerical verifications of Riemann Hypothesis (RH) improved bounds in counterexamples to the π(x) < Li(x) conjecture disproof and improved lower bounds for Mertens conjecture improved bounds for de Bruijn – Newman constant ...

Andrew Odlyzko ( School of Mathematics University of Minnesota odlyzko@umn.edu http://www.dtc.umn.edu/∼odlyzko ) Computation and the Riemann Hypothesis: Dedicated to Herman te Riele on the occasio December 2, 2011 3 / 15

slide-4
SLIDE 4

Riemann, 1859: almost all nontrivial zeros of the zeta function are on the critical line (positive assertion, no hint of proof) it is likely that all such zeros are on the critical line (now called the Riemann Hypothesis, RH) (ambiguous: cites computations of Gauss and others, not clear how strongly he believed in it) π(x) < Li(x)

Andrew Odlyzko ( School of Mathematics University of Minnesota odlyzko@umn.edu http://www.dtc.umn.edu/∼odlyzko ) Computation and the Riemann Hypothesis: Dedicated to Herman te Riele on the occasio December 2, 2011 4 / 15

slide-5
SLIDE 5

Riemann explicit connection between primes and zeros: π(x) = Li(x) −

  • ρ

Li(xρ) + O(x1/2 log x) where ρ runs over the nontrivial zeros of ζ(s), and similar formulas for other functions, such as M(x) =

n≤x µ(n)

Andrew Odlyzko ( School of Mathematics University of Minnesota odlyzko@umn.edu http://www.dtc.umn.edu/∼odlyzko ) Computation and the Riemann Hypothesis: Dedicated to Herman te Riele on the occasio December 2, 2011 5 / 15

slide-6
SLIDE 6

Turing and te Riele: Amusing coincidences: this lecture in the Turing Room 2012 is the Turing centenary, as well as te Riele’s 65-th birthday and retirement Turing’s and te Riele’s researches on the zeta function revolved around numerical verifications of RH and use

  • f zeta zeros to study functions such as π(x) − Li(x)

Andrew Odlyzko ( School of Mathematics University of Minnesota odlyzko@umn.edu http://www.dtc.umn.edu/∼odlyzko ) Computation and the Riemann Hypothesis: Dedicated to Herman te Riele on the occasio December 2, 2011 6 / 15

slide-7
SLIDE 7

Numerical verifications of RH for first n zeros: Riemann 1859 ? ... Hutchinson 1925 138 Titchmarsh et al. 1935/6 1,041 Turing 1952 1,054 ... te Riele et al. 1986 1,500,000,000 ... Gourdon 2004 10,000,000,000,000

Andrew Odlyzko ( School of Mathematics University of Minnesota odlyzko@umn.edu http://www.dtc.umn.edu/∼odlyzko ) Computation and the Riemann Hypothesis: Dedicated to Herman te Riele on the occasio December 2, 2011 7 / 15

slide-8
SLIDE 8

Blocks of zeros at large heights: O. 1023 Gourdon 1024 Bober and Hiary 1032

Andrew Odlyzko ( School of Mathematics University of Minnesota odlyzko@umn.edu http://www.dtc.umn.edu/∼odlyzko ) Computation and the Riemann Hypothesis: Dedicated to Herman te Riele on the occasio December 2, 2011 8 / 15

slide-9
SLIDE 9

Algorithms for verifying RH for first n zeros: Euler–Maclaurin n2+o(1) Riemann–Siegel n

3 2+o(1)

O.–Sch¨

  • nhage

n1+o(1)

Andrew Odlyzko ( School of Mathematics University of Minnesota odlyzko@umn.edu http://www.dtc.umn.edu/∼odlyzko ) Computation and the Riemann Hypothesis: Dedicated to Herman te Riele on the occasio December 2, 2011 9 / 15

slide-10
SLIDE 10

Algorithms for single values of zeta at height t: Euler–Maclaurin t1+o(1) Riemann–Siegel t1/2+o(1) Sch¨

  • nhage

t3/8+o(1) Heath-Brown t1/3+o(1) Hiary t4/13+o(1)

Andrew Odlyzko ( School of Mathematics University of Minnesota odlyzko@umn.edu http://www.dtc.umn.edu/∼odlyzko ) Computation and the Riemann Hypothesis: Dedicated to Herman te Riele on the occasio December 2, 2011 10 / 15

slide-11
SLIDE 11

The validity of RH: Turing’s skepticism grew with time many other famous number theorists were disbelievers (e.g., Littlewood) skepticism appears to have diminished, because of computations and various heuristics (many assisted by computations) but ...

Andrew Odlyzko ( School of Mathematics University of Minnesota odlyzko@umn.edu http://www.dtc.umn.edu/∼odlyzko ) Computation and the Riemann Hypothesis: Dedicated to Herman te Riele on the occasio December 2, 2011 11 / 15

slide-12
SLIDE 12

Critical strip:

normalized spacing density difference 0.0 0.5 1.0 1.5 2.0 2.5 3.0

  • 0.010
  • 0.005

0.0 0.005 0.010

Nearest neighbor spacings: Empirical minus expected

Andrew Odlyzko ( School of Mathematics University of Minnesota odlyzko@umn.edu http://www.dtc.umn.edu/∼odlyzko ) Computation and the Riemann Hypothesis: Dedicated to Herman te Riele on the occasio December 2, 2011 12 / 15

slide-13
SLIDE 13

Beware the law of small numbers (especially in number theory): N(t) = 1 + 1

πθ(t) + S(t)

where θ(t) is a smooth function, and S(t) is small: |S(t)| = O(log t) 1 t t

10

S(u)2du ∼ c log log t |S(t)| < 1 for t < 280 |S(t)| < 2 for t < 6.8 × 106 largest observed value of |S(t)| only a bit over 3

Andrew Odlyzko ( School of Mathematics University of Minnesota odlyzko@umn.edu http://www.dtc.umn.edu/∼odlyzko ) Computation and the Riemann Hypothesis: Dedicated to Herman te Riele on the occasio December 2, 2011 13 / 15

slide-14
SLIDE 14

Conclusion (from a sign in a computing support office): We are sorry that we have not been able to solve all of your problems, and we realize that you are about as confused now as when you came to us for help. However, we hope that you are now confused on a higher level of understanding than before.

Andrew Odlyzko ( School of Mathematics University of Minnesota odlyzko@umn.edu http://www.dtc.umn.edu/∼odlyzko ) Computation and the Riemann Hypothesis: Dedicated to Herman te Riele on the occasio December 2, 2011 14 / 15

slide-15
SLIDE 15

More information, papers and data sets: http://www.dtc.umn.edu/∼odlyzko/ in particular, recent paper with Dennis Hejhal, “Alan Turing and the Riemann zeta function”

Andrew Odlyzko ( School of Mathematics University of Minnesota odlyzko@umn.edu http://www.dtc.umn.edu/∼odlyzko ) Computation and the Riemann Hypothesis: Dedicated to Herman te Riele on the occasio December 2, 2011 15 / 15