Hendrik Lenstra
Hendrik W. Lenstra Jr.
Born (1949-04-16) 16 April 1949
Zaandam, Netherlands
NationalityDutch
Alma materUniversity of Amsterdam
Known forLenstra elliptic-curve factorization
Lenstra–Lenstra–Lovász lattice basis reduction algorithm
Lenstra–Pomerance–Wagstaff conjecture
APR-CL primarily test
Awards
Scientific career
FieldsMathematics
InstitutionsUniversity of California, Berkeley
University of Leiden
ThesisEuclidische getallenlichamen (1977)
Doctoral advisorFrans Oort
Doctoral students

Hendrik Willem Lenstra Jr. (born 16 April 1949, Zaandam) is a Dutch mathematician.

Biography

Lenstra received his doctorate from the University of Amsterdam in 1977 and became a professor there in 1978. In 1987, he was appointed to the faculty of the University of California, Berkeley; starting in 1998, he divided his time between Berkeley and the University of Leiden, until 2003, when he retired from Berkeley to take a full-time position at Leiden.[1]

Three of his brothers, Arjen Lenstra, Andries Lenstra, and Jan Karel Lenstra, are also mathematicians. Jan Karel Lenstra is the former director of the Netherlands Centrum Wiskunde & Informatica (CWI). Hendrik Lenstra was the Chairman of the Program Committee of the International Congress of Mathematicians in 2010.[2]

Scientific contributions

Lenstra has worked principally in computational number theory. He is well known for:

Awards and honors

In 1984, Lenstra became a member of the Royal Netherlands Academy of Arts and Sciences.[7] He won the Fulkerson Prize in 1985 for his research using the geometry of numbers to solve integer programs with few variables in time polynomial in the number of constraints.[8] He was awarded the Spinoza Prize in 1998,[9] and on 24 April 2009 he was made a Knight of the Order of the Netherlands Lion. In 2009, he was awarded a Gauss Lecture by the German Mathematical Society. In 2012, he became a fellow of the American Mathematical Society.[10]

Publications

  • Euclidean Number Fields. Parts 1-3, Mathematical Intelligencer 1980
  • with A. K. Lenstra: Algorithms in Number Theory. pp. 673–716, In Jan van Leeuwen (ed.): Handbook of Theoretical Computer Science, Vol. A: Algorithms and Complexity. Elsevier and MIT Press 1990, ISBN 0-444-88071-2, ISBN 0-262-22038-5.
  • Algorithms in Algebraic Number Theory. Bulletin of the AMS, vol. 26, 1992, pp. 211–244.
  • Primality testing algorithms. Séminaire Bourbaki 1981.
  • with Stevenhagen: Artin reciprocity and Mersenne Primes. Nieuw Archief for Wiskunde 2000.
  • with Stevenhagen: Chebotarev and his density theorem. Mathematical Intelligencer 1992 (Online at Lenstra's Homepage).
  • Profinite Fibonacci Numbers, December 2005, PDF

See also

References

  1. ↑ Prof. dr. H.W. Lenstra, 1949 - at the University of Amsterdam Album Academicum website
  2. ↑ ICM – International Congress of Mathematicians
  3. ↑ H.W. Lenstra, "Integer programming with a fixed number of variables", Mathematics of operations research, Vol 8, No 8, November 1983
  4. ↑ Factoring integers with elliptic curves. Annals of Mathematics, vol. 126, 1987, pp. 649–673
  5. ↑ Lenstra Jr. H.W. (1992). "On the inverse Fermat equation". Discrete Mathematics. 106–107: 329–331. doi:10.1016/0012-365x(92)90561-s.
  6. ↑ Cohen, Henri (1993), "Chapter 5.10", A Course in Computational Algebraic Number Theory, Berlin: Springer, ISBN 978-3-540-55640-4
  7. ↑ "Hendrik Lenstra". Royal Netherlands Academy of Arts and Sciences. Archived from the original on 4 March 2016. Retrieved 19 July 2015.
  8. ↑ Past winners of the Fulkerson Prize, retrieved 2015-07-18.
  9. ↑ "NWO Spinoza Prize 1998". Netherlands Organisation for Scientific Research. 11 September 2014. Archived from the original on 9 March 2018. Retrieved 30 January 2016.
  10. ↑ List of Fellows of the American Mathematical Society, retrieved 2013-01-27.
    This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.