David G. Cantor
BornApril 12, 1935
DiedNovember 19, 2012
Alma materUniversity of California, Los Angeles
Known forCantor–Zassenhaus algorithm

David Geoffrey Cantor (April 12, 1935 – November 19, 2012) was an American mathematician, specializing in number theory and combinatorics. The Cantor–Zassenhaus algorithm for factoring polynomials is named after him; he and Hans Zassenhaus published it in 1981.

Biography

Cantor was born on April 12, 1935.[1] He completed his undergraduate studies at the California Institute of Technology, graduating in 1956, and earned his doctorate from the University of California, Los Angeles (UCLA) in 1960, where he was supervised by Basil Gordon and Ernst G. Straus.[2][3] He became an assistant professor at the University of Washington in 1962, moved back to UCLA in 1964, and retired in 1991. After his retirement, he worked at the Center for Communications Research in La Jolla, California.[2]

Cantor specialized in number theory and combinatorics.[2] The Cantor–Zassenhaus algorithm for factoring polynomials is named after him; he and Hans Zassenhaus published it in 1981.[4] He received the National Science Foundation Postdoctoral Fellowship in 1960 and a Sloan Foundation Fellowship in 1968.[2] In 2012, he became one of the inaugural fellows of the American Mathematical Society.[5] At the time of his death, he had been a member of the American Mathematical Society for 54 years.[1]

Cantor lived in San Diego, California. He died on November 19, 2012, at the age of 77.[2][1]

See also

References

  1. 1 2 3 "Deaths of AMS Members" (PDF). Notices of the American Mathematical Society. Vol. 60, no. 5. American Mathematical Society. May 2013. p. 626. ISSN 1088-9477. Archived (PDF) from the original on 23 April 2013. Retrieved 3 Apr 2021.
  2. 1 2 3 4 5 In Memoriam: David G. Cantor Professor of Mathematics, 1935 - 2012, UCLA Department of Mathematics, retrieved 2014-12-18.
  3. ↑ David Geoffrey Cantor at the Mathematics Genealogy Project
  4. ↑ Cantor, David G.; Zassenhaus, Hans (April 1981), "A new algorithm for factoring polynomials over finite fields", Mathematics of Computation, 36 (154): 587–592, doi:10.1090/S0025-5718-1981-0606517-5, JSTOR 2007663, MR 0606517.
  5. ↑ List of Fellows of the American Mathematical Society, retrieved 2014-12-18.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.