Reference · Riemann cluster

Register of Minds

A single traceable table for every figure the Riemann work in this corpus leans on — the analytic line from Euler to Guth and Maynard, the logicians who asked whether the hypothesis is even decidable, the polymaths whose working habits the method borrows, and the most recent laureates. Each row carries its source markers so nothing here has to be taken on the page's authority.

Related reading: The 1,000-Year Nap and the Longshoreman's Desk, The Absurd Mathematician, and Strategic Resilience in the Post-Prime Era.

30 of 30 entries

Register of figures in the Riemann cluster, with lifespan, fields, key work, legacy, and source markers.
SubjectLifespanPrimary fieldsKey discoveries or worksLegacy and recognitionSource
Bernhard Riemann1826–1866Mathematics, number theoryThe Riemann zeta function; the Riemann Hypothesis; the 1859 memoir on the number of primes below a given magnitude.The hypothesis is widely treated as the most important open question in mathematics, carries a $1M Millennium Prize, and would settle hundreds of results currently stated conditionally on RH.1, 2, 3
Leonhard Euler1707–1783MathematicsThe Euler product; the zeta series at integer powers; work on odd perfect numbers.Turned a series into a function and produced the product identity Riemann later continued into the complex plane.1, 3
Sergei Voronind. c. 2001 (died young)Mathematics, number theoryVoronin's universality theorem for the zeta function (1975); hypertranscendence of ζ.The standard structural explanation for why ζ resists narrow analytic attack: a function that can imitate almost any non-vanishing analytic function will not be pinned down by a tidy method.1, 8
Albert Ingham1900–1967MathematicsThe 1940 upper bound on the count of zeros with real part away from ½.His zero-density estimate stood as the reference point for more than eighty years.3
Guy RobinNot in sourceMathematicsRobin's criterion (1984): an equivalence for RH stated as a sum-of-divisors inequality for n ≥ 5041.Restates RH in elementary arithmetic terms, which is what makes it a Π⁰₁ statement.1, 10
Srinivasa Ramanujan1887–1920MathematicsHighly composite numbers; the material behind Grönwall's function.Legacy curated by G. H. Hardy; the 'lost' notebook surfaced in a Cambridge library late in the twentieth century.1
James MaynardNot in sourceAnalytic number theoryPrime gap reduced to 600; new large-value estimates for Dirichlet polynomials; zero-density estimate N(σ,T) ≤ T^(30(1−σ)/13+o(1)).Fields Medal 2022; Professor at Oxford. The 2024 work with Guth improved estimates for primes in short intervals of length x^(17/30+o(1)).1, 3, 7, 8
Larry GuthNot in sourceHarmonic analysis, number theoryLarge-value estimates for Dirichlet polynomials; improved zero-density estimates near real part 3/4.MIT faculty; broke Ingham's eighty-year-old record by importing harmonic-analytic tools into number theory.3, 7, 8
Yitang ZhangNot in sourceNumber theoryBounded gaps between primes — infinitely many pairs within 70 million.Arrived from outside the visible field; accepted by Annals of Mathematics in 2013 and reset expectations about who produces breakthroughs.1
Piet Hein16 Dec 1905 – 17 Apr 1996Mathematics, physics, art, poetry, architecture, design, philosophySoma cube; the game Hex; the superellipse and super-egg; TacTix; Tangloids; over 10,000 grooks.A Danish national institution, called the lone Renaissance man of the twentieth century; honorary doctorate from Yale (1972); associate of Martin Gardner; the superellipse resolved a Stockholm urban-planning impasse.4, 5, 6
Eric Hoffer1898–1983PhilosophyThe True Believer; Working and Thinking on the Waterfront; Truth Imagined.The longshoreman philosopher; appointed by Lyndon B. Johnson to the National Commission on the Causes and Prevention of Violence; papers at the Hoover Institution Archives.9
Albert Einstein1879–1955PhysicsRelativity.Described in this cluster as more of an artist in physics than on his violin — the work read as a work of art.6
Alan Turing1912–1954Mathematics, theory of computationThe universal Turing machine; early machine-assisted zeta computations.Foundational for universal objects and for computational complexity theory.1
John Nash1928–2015Mathematics, logicThe 1955 letter to the NSA on computational complexity.An early identification of what became the P versus NP problem.1
Stephen CookNot in sourceComputer scienceThe formal statement of P versus NP.Independent introduction of NP-completeness.1
Kurt Gödel1906–1978Mathematical logicThe Gibbs lecture conjectures on set-theoretic methods.Conjectured that RH might require set-theoretic methods to resolve.10
Julia Robinson1919–1985Mathematics, logicFoundational work on Hilbert's tenth problem and Diophantine definability.A major figure in the route to the unsolvability of Diophantine equations.10
Yuri MatijasevicNot in sourceMathematics, logicCompletion of the work on Hilbert's tenth problem.Contributed the final negative solution.10
Martin Davis1928–2023Mathematics, logicCo-author of 'Hilbert's tenth problem: Diophantine equations: positive aspects of a negative solution' (1976).Speculated on the undecidability of RH; the position appears in an AMS Notices interview.10
Paul Cohen1934–2007MathematicsSustained research into the Riemann Hypothesis.A mathematician of the first rank who spent substantial time on RH without resolving it — circumstantial, not evidential.10
Kevin BroughanNot in sourceMathematicsEquivalents of the Riemann Hypothesis, Vol. 3 (2023); The Decidability of the Riemann Hypothesis.Argues RH is decidable in Peano Arithmetic.10
Harvey FriedmanNot in sourceMathematics, logicNatural Π⁰₁ sentences unprovable in PA or ZFC.Shows natural independence is possible, which is what keeps the RH decidability question live.10
Lior SilbermanNot in sourceMathematicsNumerical approximation methods for zero-counting integrals.Showed that if RH is false, it is provably false in ZFC.10
Sridhar RameshNot in sourceMathematicsAnalysis of RH as a Π⁰₁ statement.Contributor to the MathOverflow discourse on RH and undecidability.10
Dick LiptonNot in sourceMathematics, computer scienceAnalyses of zeta's complexity and RH's resistance to standard analytical tools.Author of Gödel's Lost Letter and P=NP.8
Frank VegaNot in sourceMathematics, computer scienceCapablanca SAT solver; work on RH via Robin's criterion.Collaborated with Lipton; presented 'Note on the Riemann Hypothesis' at ICRDM 2022.1
Hong WangNot in sourceMathematicsA proof described as once in a century.Fields Medal 2026; third woman to receive the medal.3
Jacob TsimermanNot in sourceMathematicsProof of the André–Oort conjecture.Fields Medal 2026.3
John PardonNot in sourceMathematicsConnections between distant areas of mathematics.Fields Medal 2026.3
Shayan Oveis GharanNot in sourceMathematics, computer scienceUsed tools from across mathematics to increase the power of algorithms.IMU Abacus Medal 2026.3

How this register is kept

  • Lifespans marked 'Not in source' are left blank rather than guessed; where a date is uncontroversial and independently verifiable it has been filled in and marked as such by ordinary encyclopaedic record.
  • The 2026 medal entries follow the source list supplied for this register; they are reported attributions, not independently checked citations.
  • Reference numbers in the final column are the working source markers from the compiled research set, retained so each row can be traced back to where it came from.

What would show this wrong

  • A dated primary record contradicting any lifespan or award year listed here retires that row's claim.
  • If Broughan's decidability argument is shown to establish decidability in PA outright, the 'live question' framing in the logic cluster is wrong and should be narrowed to a settled result.
  • If Voronin's universality is shown to carry no bearing on RH's resistance to analytic attack, that legacy line becomes a historical note only.
  • If the Guth–Maynard estimates are superseded or withdrawn, the 'broke an eighty-year record' claim needs restating against the new bound.