Jeffrey Lagarias

Last updated

Jeffrey Clark Lagarias (born November 16, 1949, in Pittsburgh, Pennsylvania, United States) is a mathematician and professor at the University of Michigan.

Contents

Education

While in high school in 1966, Lagarias studied astronomy at the Summer Science Program.

He completed an S.B. and S.M. in Mathematics at the Massachusetts Institute of Technology in 1972. [1] The title of his thesis was "Evaluation of certain character sums". [1] He was a Putnam Fellow at MIT in 1970. [2] He received his Ph.D. in Mathematics from MIT for his thesis "The 4-part of the class group of a quadratic field", in 1974. [1] [3] His advisor for both his masters and Ph.D was Harold Stark. [1]

Career

In 1974, he joined AT&T Bell Laboratories and eventually became a member of technical staff. From 1995 to 2004, he was a Technology Consultant at AT&T Research Laboratories. In 2004, he moved to the University of Michigan as a professor of mathematics. [1]

Research

Lagarias originally worked in analytic algebraic number theory. His later work has been in theoretical computer science.[ citation needed ]

Lagarias discovered an elementary problem that is equivalent to the Riemann hypothesis, namely whether for all n > 0, we have

with equality only when n = 1. Here Hn is the nth harmonic number, the sum of the reciprocals of the first positive integers, and σ(n) is the divisor function, the sum of the positive divisors of n. [4]

He disproved Keller's conjecture in dimensions at least 10. Lagarias has also done work on the Collatz conjecture and Li's criterion and has written several highly cited papers in symbolic computation with Dave Bayer.[ citation needed ]

Awards and honors

Lagarias received in 1986 a Lester R. Ford award from the Mathematical Association of America [5] and again in 2007. [6] [7]

In 2012, he became a fellow of the American Mathematical Society. [8]

In 2024 he was elected as a member of the National Academy of Sciences. [9]

Related Research Articles

<span class="mw-page-title-main">Riemann zeta function</span> Analytic function in mathematics

The Riemann zeta function or Euler–Riemann zeta function, denoted by the Greek letter ζ (zeta), is a mathematical function of a complex variable defined as for , and its analytic continuation elsewhere.

<span class="mw-page-title-main">Goldbach's conjecture</span> Even integers as sums of two primes

Goldbach's conjecture is one of the oldest and best-known unsolved problems in number theory and all of mathematics. It states that every even natural number greater than 2 is the sum of two prime numbers.

<span class="mw-page-title-main">Euler's constant</span> Constant value used in mathematics

Euler's constant is a mathematical constant, usually denoted by the lowercase Greek letter gamma, defined as the limiting difference between the harmonic series and the natural logarithm, denoted here by log:

The Riemann hypothesis is one of the most important conjectures in mathematics. It is a statement about the zeros of the Riemann zeta function. Various geometrical and arithmetical objects can be described by so-called global L-functions, which are formally similar to the Riemann zeta-function. One can then ask the same question about the zeros of these L-functions, yielding various generalizations of the Riemann hypothesis. Many mathematicians believe these generalizations of the Riemann hypothesis to be true. The only cases of these conjectures which have been proven occur in the algebraic function field case.

<span class="mw-page-title-main">Analytic number theory</span> Exploring properties of the integers with complex analysis

In mathematics, analytic number theory is a branch of number theory that uses methods from mathematical analysis to solve problems about the integers. It is often said to have begun with Peter Gustav Lejeune Dirichlet's 1837 introduction of Dirichlet L-functions to give the first proof of Dirichlet's theorem on arithmetic progressions. It is well known for its results on prime numbers and additive number theory.

<span class="mw-page-title-main">Mertens conjecture</span> Disproved mathematical conjecture

In mathematics, the Mertens conjecture is the statement that the Mertens function is bounded by . Although now disproven, it had been shown to imply the Riemann hypothesis. It was conjectured by Thomas Joannes Stieltjes, in an 1885 letter to Charles Hermite, and again in print by Franz Mertens, and disproved by Andrew Odlyzko and Herman te Riele . It is a striking example of a mathematical conjecture proven false despite a large amount of computational evidence in its favor.

<span class="mw-page-title-main">Divisor function</span> Arithmetic function related to the divisors of an integer

In mathematics, and specifically in number theory, a divisor function is an arithmetic function related to the divisors of an integer. When referred to as the divisor function, it counts the number of divisors of an integer. It appears in a number of remarkable identities, including relationships on the Riemann zeta function and the Eisenstein series of modular forms. Divisor functions were studied by Ramanujan, who gave a number of important congruences and identities; these are treated separately in the article Ramanujan's sum.

<span class="mw-page-title-main">Mertens function</span> Summatory function of the Möbius function

In number theory, the Mertens function is defined for all positive integers n as

<span class="mw-page-title-main">Pál Turán</span> Hungarian mathematician

Pál Turán also known as Paul Turán, was a Hungarian mathematician who worked primarily in extremal combinatorics.

In mathematics, an untouchable number is a positive integer that cannot be expressed as the sum of all the proper divisors of any positive integer. That is, these numbers are not in the image of the aliquot sum function. Their study goes back at least to Abu Mansur al-Baghdadi, who observed that both 2 and 5 are untouchable.

In mathematics, the Lindelöf hypothesis is a conjecture by Finnish mathematician Ernst Leonard Lindelöf about the rate of growth of the Riemann zeta function on the critical line. This hypothesis is implied by the Riemann hypothesis. It says that for any ε > 0, as t tends to infinity. Since ε can be replaced by a smaller value, the conjecture can be restated as follows: for any positive ε,

In mathematics, a superabundant number is a certain kind of natural number. A natural number n is called superabundant precisely when, for all m < n:

<span class="mw-page-title-main">Colossally abundant number</span> Type of natural number

In number theory, a colossally abundant number is a natural number that, in a particular, rigorous sense, has many divisors. Particularly, it is defined by a ratio between the sum of an integer's divisors and that integer raised to a power higher than one. For any such exponent, whichever integer has the highest ratio is a colossally abundant number. It is a stronger restriction than that of a superabundant number, but not strictly stronger than that of an abundant number.

In mathematics, the explicit formulae for L-functions are relations between sums over the complex number zeroes of an L-function and sums over prime powers, introduced by Riemann (1859) for the Riemann zeta function. Such explicit formulae have been applied also to questions on bounding the discriminant of an algebraic number field, and the conductor of a number field.

In number theory, friendly numbers are two or more natural numbers with a common abundancy index, the ratio between the sum of divisors of a number and the number itself. Two numbers with the same "abundancy" form a friendly pair; n numbers with the same abundancy form a friendly n-tuple.

<span class="mw-page-title-main">Helmut Maier</span> German mathematician

Helmut Maier is a German mathematician and professor at the University of Ulm, Germany. He is known for his contributions in analytic number theory and mathematical analysis and particularly for the so-called Maier's matrix method as well as Maier's theorem for primes in short intervals. He has also done important work in exponential sums and trigonometric sums over special sets of integers and the Riemann zeta function.

In mathematics, the standard conjectures about algebraic cycles are several conjectures describing the relationship of algebraic cycles and Weil cohomology theories. One of the original applications of these conjectures, envisaged by Alexander Grothendieck, was to prove that his construction of pure motives gave an abelian category that is semisimple. Moreover, as he pointed out, the standard conjectures also imply the hardest part of the Weil conjectures, namely the "Riemann hypothesis" conjecture that remained open at the end of the 1960s and was proved later by Pierre Deligne; for details on the link between Weil and standard conjectures, see Kleiman (1968). The standard conjectures remain open problems, so that their application gives only conditional proofs of results. In quite a few cases, including that of the Weil conjectures, other methods have been found to prove such results unconditionally.

<span class="mw-page-title-main">Riemann hypothesis</span> Conjecture on zeros of the zeta function

In mathematics, the Riemann hypothesis is the conjecture that the Riemann zeta function has its zeros only at the negative even integers and complex numbers with real part 1/2. Many consider it to be the most important unsolved problem in pure mathematics. It is of great interest in number theory because it implies results about the distribution of prime numbers. It was proposed by Bernhard Riemann, after whom it is named.

In mathematics, specifically in number theory, the extremal orders of an arithmetic function are best possible bounds of the given arithmetic function. Specifically, if f(n) is an arithmetic function and m(n) is a non-decreasing function that is ultimately positive and

<span class="mw-page-title-main">Cameron Leigh Stewart</span> Canadian mathematician

Cameron Leigh Stewart FRSC is a Canadian mathematician. He is a professor of pure mathematics at the University of Waterloo.

References

  1. 1 2 3 4 5 "Jeffrey C. Lagarias" (PDF). CV.
  2. "Putnam Competition Individual and Team Winners". Mathematical Association of America. Archived from the original on March 12, 2014. Retrieved December 13, 2021.
  3. "Jeffrey Lagarias, Professor". University of Michigan. Archived from the original on 2010-11-18. Retrieved 2010-11-09.
  4. Lagarias, Jeffrey C. (2002). "An Elementary Problem Equivalent to the Riemann Hypothesis". Amer. Math. Monthly. 109 (6): 534–543. arXiv: math/0008177 . doi:10.1080/00029890.2002.11919883. S2CID   218549013.
  5. Lagarias, Jeffrey C. (1985). "The 3x + 1 Problem and Its Generalizations". Amer. Math. Monthly. 92 (1): 3–23. doi:10.2307/2322189. JSTOR   2322189.
  6. Lagarias, Jeffrey C. (2006). "Wild and Wooley Numbers". Amer. Math. Monthly. 113 (2): 97–106. doi:10.2307/27641862. JSTOR   27641862.
  7. "Lester R. Ford Awards". maa.org. Mathematical Association of America . Retrieved 2019-08-16.
  8. List of Fellows of the American Mathematical Society, retrieved 2013-01-27.
  9. "National Academy of Sciences Elects Members and International Members". April 30, 2024.