Arthur Rubin

From Wikipedia, the free encyclopedia

Arthur L. Rubin (born 1956) is an American mathematician who has earned a place among the five top-ranked undergraduate competitors (who are themselves not ranked against each other) in the William Lowell Putnam Competition four times (1970–73), a feat matched by only five other undergraduate students (Don Coppersmith [1968–71], Bjorn M. Poonen [1985–88], Ravi D. Vakil [1988–91], Gabriel D. Carroll [2000–03], and Reid W. Barton [2001–2004]).[1]

Rubin earned his Ph.D. in 1978 at the California Institute of Technology under the direction of Alexander S. Kechris, with a dissertation entitled "Free Algebras in Von Neumann-Bernays-Gödel Set Theory and Positive Elementary Inductions in Reasonable Structures".[2]

In 1980, Rubin co-authored a paper on graph theory with Paul Erdős, giving him an Erdős number of 1.[3]

[edit] References

  1. ^ Mathematical Association of America, The. The Mathematical Association of America's William Lowell Putnam Competition. Retrieved on 2006-04-25.
  2. ^ The Mathematics Genealogy Project. Arthur Rubin. Retrieved on 2006-09-16.
  3. ^ P. Erdős, A. L. Rubin and H. Taylor (1979). "Choosability in graphs". Proc. West Coast Conf. on Combinatorics, Graph Theory and Computing, Congressus Numerantium XXVI: 125–157.
This article about a mathematician is a stub. You can help Wikipedia by expanding it.
Retrieved from "http://en.wikipedia.org../../../a/r/t/Arthur_Rubin_108b.html"