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 since the first competition in 1938. [1]
His mother was J. E. H. Rubin, Professor of Mathematics at Purdue University for over 35 years, and his father, H. Rubin, Professor of Statistics at the same university. [2]
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".[3]
In 1980, Rubin co-authored a paper on graph theory with Paul Erdős, giving him an Erdős number of 1.[4]
He has published several other academic papers: [5] [6] [7]
[edit] References
- ^ Mathematical Association of America, The. The Mathematical Association of America's William Lowell Putnam Competition. Retrieved on 2006-04-25.
- ^ Dinah L. McClure, editor (2002). "Obituary: J. E. H. Rubin". Sequel (38): 2. Retrieved on 2006-04-25.
- ^ The Mathematics Genealogy Project. Arthur Rubin. Retrieved on 2006-12-16.
- ^ 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.
- ^ P. E. Howard, A. L. Rubin, & J. E. Rubin (1979). "Kinna-Wagner Selection Principles, Axioms of Choice and Multiple Choice". Monatshefte fur Mathematkik, 123 (4): 309–319.
- ^ E. C. Posner & A.L. Rubin, (1984). "Capacity of digital links in tandem.". IEEE Transactions on Information Theory. IT-30 (3): 464–470.
- ^ T. K. Truong, I. S. Reed, R. G. Lipes, A. L. Rubin, & S. A. Butman & A.L. Rubin, (1984). "Digital SAR processing using a fast polynomial transform". IEEE Transactions on Acoustics, Speech, and Signal Processing ASSP-32 (2): 419-425.
