Donald J. Newman

From Wikipedia, the free encyclopedia
Donald J. Newman
Born (1930-07-27)July 27, 1930
Brooklyn, New York
Died March 28, 2007(2007-03-28) (aged 76)
Philadelphia, Pennsylvania[1]
Nationality American
Fields Mathematics
Institutions Yeshiva University
Temple University
New York University
Alma mater Harvard University
Doctoral advisor David Widder
Joseph Leonard Walsh
Doctoral students Eli Passow
Louis Raymon

Donald J. (D. J.) Newman (July 27, 1930 – March 28, 2007) was an American mathematician and professor, excelling at the Putnam mathematics competition while an undergraduate at City College of New York and New York University, and later receiving his PhD from Harvard University in 1953.[2]

Life and works

Newman was born in Brooklyn, New York in 1930, and studied at New York's Stuyvesant High School.[3] He was an avid problem-solver, and as an undergraduate was a Putnam Fellow all three years he took part in the Putnam math competition; only the third person to attain that feat.[4] His mathematical specialties included complex analysis, approximation theory and number theory. In 1980 he found a short proof of the prime number theorem, which can now be found in his textbook on Complex analysis[5]

Newman was a friend and associate of John Nash.[6]:144–145 His career included posts as a Professor of Mathematics at MIT, Brown University, Yeshiva University, Temple University and a distinguished chair at Bar Ilan University in Israel.[7] He held government and industry positions at Avco, Republic Aviation, Bell Laboratories, IBM and the NSA.[citation needed]

Newman's love of problem solving comes through in his writing; his published output as a mathematician includes 150 papers and five books. He taught numerous students over the years, including Robert Feinerman, Jonah Mann, Eli Passow, Louis Raymon, Shmuel Weinberger, and Gerald Weinstein at Yeshiva University, and Bo Gao, Don Kellman, Jonathan Knappenberger, and Yuan Xu at Temple University.

See also

Selected publications

Papers and monographs

  • The Hexagon Theorem (1982 )
  • Finite type functions as limits of exponential sums (1974, MRC technical summary report)
  • Splines and the logarithmic function (1974, MRC)
  • Thought Less Mathematics, an essay on why branching thinking and similar solutions aren't central to mathematics and may even obscure deeper ideas

References

  1. Math Forum Discussions - Obituary
  2. Though The Math Genealogy Project lists it as 1958.
  3. "Stuyvesant Math Team". Retrieved 2007-10-31. 
  4. See Joseph Gallian's history of the competition and the official MAA record
  5. Joseph Bak, and D.J.Newman, Complex analysis. (Undergraduate Texts in Mathematics), Springer Verlag, 3rd edition, 2010.
  6. Nasar, Sylvia (1998). A Beautiful Mind. New York: Simon & Schuster. ISBN 0-684-85370-1. 
  7. "In Memoriam: Donald Newman". Temple University. 2007-04-24. Retrieved 2008-08-11. 
  8. Rivlin, Theodore J. (1975). "Review: Polynomial approximation, by R, P. Feinerman and D. J. Newman". Bull. Amer. Math. Soc. 81 (1): 28–30. 

External links

This article is issued from Wikipedia. The text is available under the Creative Commons Attribution/Share Alike; additional terms may apply for the media files.