Jump to content

John Friedlander

From Wikipedia, the free encyclopedia
(Redirected from John B. Friedlander)

John Benjamin Friedlander
Friedlander in 2008
CitizenshipCanadian
Alma materUniversity of Toronto, University of Waterloo, Pennsylvania State University
Known forAnalytic number theory
Bombieri–Friedlander–Iwaniec theorem
AwardsFellow of the Royal Society of Canada, Jeffery–Williams Prize, Fellow of American Mathematical Society, 2012
Scientific career
FieldsMathematics
InstitutionsInstitute for Advanced Study
MIT
University of Toronto
Doctoral advisorSarvadaman Chowla
Doctoral studentsCem Yıldırım

John Friedlander FRSC is a Canadian mathematician specializing in analytic number theory. He received his B.Sc. from the University of Toronto in 1965, an M.A. from the University of Waterloo in 1966, and a Ph.D. from Pennsylvania State University in 1972. He was a lecturer at M.I.T. in 1974–76, and has been on the faculty of the University of Toronto since 1977, where he served as Chair during 1987–91. He has also spent several years at the Institute for Advanced Study. In addition to his individual work, he has been notable for his collaborations with other well-known number theorists, including Enrico Bombieri, William Duke, Andrew Granville, and especially Henryk Iwaniec.[1]

In 1997, in joint work with Henryk Iwaniec, Friedlander proved that infinitely many prime numbers can be obtained as the sum of a square and fourth power: a2 + b4.[2][3] Friedlander and Iwaniec improved Enrico Bombieri's "asymptotic sieve" technique to construct their proof.[4]

Awards and honors

[edit]

Selected publications

[edit]
  • Friedlander, John; Iwaniec, Henryk (2010). Opera de Cribro. Providence: American Mathematical Society. ISBN 978-0-8218-4970-5.[8][9]

See also

[edit]

References

[edit]
  1. ^ "John B. Friedlander (Toronto)". Centre de recherches mathématiques. Retrieved December 5, 2021.
  2. ^ Friedlander, John; Iwaniec, Henryk (1998). "The polynomial X2 + Y4 captures its primes" (PDF). Annals of Mathematics. 148 (3): 945–1040. arXiv:math/9811185. doi:10.2307/121034. JSTOR 121034. S2CID 1187277.
  3. ^ Friedlander, John; Iwaniec, Henryk (1997). "Using a parity-sensitive sieve to count prime values of a polynomial". PNAS. 94 (4): 1054–1058. Bibcode:1997PNAS...94.1054F. doi:10.1073/pnas.94.4.1054. PMC 19742. PMID 11038598..
  4. ^ International Team Shows that Primes Can Be Found in Surprising Places
  5. ^ Search Royal Society of Canada Fellows Archived February 4, 2020, at the Wayback Machine, retrieved 2013-01-2013.
  6. ^ "Fellows of the American Mathematical Society". American Mathematical Society. November 26, 2018. Retrieved October 14, 2023.
  7. ^ "Joseph L. Doob Prize". American Mathematical Society. November 26, 2018. Retrieved October 14, 2023.
  8. ^ Thorne, Frank (2012). "Book Review: An introduction to sieve methods and their applications by Alina Carmen Cojocaru and M. Ram Murty and Opera de cribro by John Friedlander and Henryk Iwaniec". Bulletin of the American Mathematical Society. 50 (2): 359–366. doi:10.1090/S0273-0979-2012-01390-3. ISSN 0273-0979.
  9. ^ Stenger, Allen (August 16, 2010). "Review of Opera de Cribro by John Friedlander and Henry Iwaniec". MAA Reviews, Mathematical Association of America.
[edit]