Rubin at the Aquarium of the Pacific in August 2006
|Born||1956 (age 62–63)|
|Thesis||Free Algebras in Von Neumann–Bernays–Gödel Set Theory and Positive Elementary Inductions in Reasonable Structures (1978)|
|Doctoral advisor||Alexander S. Kechris|
Life and careerEdit
Rubin's mother was Jean E. Rubin, a professor of mathematics at Purdue University, and his father was Herman Rubin, a professor of statistics at the same university. Arthur co-authored his first paper with his mother in 1969 at the age of 13. He earned his Ph.D. at the California Institute of Technology in 1978, under the direction of Alexander S. Kechris.
Awards and honorsEdit
As an undergraduate, Rubin was named a Putnam Fellow on four occasions, the first time in 1970, aged 14, making him the youngest Fellow to date. In 1972, he tied for third place in the first USA Mathematical Olympiad.
In 1974, Rubin was the subject of an article in the Madison Capital Times, in which his Caltech undergraduate advisor was quoted as saying that someone of Rubin's ability appeared in the United States "about once in every ten years".
Rubin's dissertation was entitled Free Algebras in Von Neumann–Bernays–Gödel Set Theory and Positive Elementary Inductions in Reasonable Structures. In 1979, Rubin co-authored a paper on list coloring of graphs with Paul Erdős, giving him an Erdős number of 1.
- Rubin, A. L. & Rubin, J. E. (1969). "Extended operations and relations on the class of ordinal numbers". Fundamenta Mathematicae. 65 (2): 227–242.
- Howard, P. E.; Rubin, A. L. & Rubin, J. E. (1979). "Kinna–Wagner Selection Principles, Axioms of Choice and Multiple Choice". Monatshefte für Mathematik. 123 (4): 309–319. doi:10.1007/BF01326766.
- Posner, E. C. & Rubin, A.L. (1984). "Capacity of digital links in tandem". IEEE Transactions on Information Theory. IT-30 (3): 464–470. doi:10.1109/TIT.1984.1056917.
- Truong, T. K.; Reed, I. S.; Lipes, R. G.; Rubin, A. L. & Butman, S. A. (1984). "Digital SAR processing using a fast polynomial transform". IEEE Transactions on Acoustics, Speech, and Signal Processing. ASSP-32 (2): 419–425. doi:10.1109/TASSP.1984.1164307.
- Bock, M. E. (2004), "Conversations with Herman Rubin", in DasGupta, Anirban (ed.), A Festschrift for Herman Rubin, Lecture notes – monograph series, 45, Institute of Mathematical Statistics, pp. 408–417, ISBN 9780940600614, JSTOR 4356327. See in particular p. 412: "Arthur was the oldest (born in 1956) and went on to get a Ph.D. from California Institute of Technology (at the age of 22) after being a Putnam Fellow four times. Arthur and Paul Erdős wrote a paper together."
- McClure, Dinah L., ed. (2002). "Obituary: J.E.H. Rubin" (PDF). Sequel (38): 2. Archived from the original (PDF) on 2006-09-02. Retrieved 2006-04-25.
- Rubin, A. L. & Rubin, J. E. (1969). "Extended operations and relations on the class of ordinal numbers". Fundamenta Mathematicae. 65 (2): 227–242. (The default language of this webpage is Polish, but it can be changed to English via the language option on the upper right)
- Arthur Rubin at the Mathematics Genealogy Project
- Ward, Mike (June 3, 1984). "Most Senators, Assemblymen Unchallenged". Los Angeles Times. Alternate Link via ProQuest.
- Alexanderson, Gerald L.; Klosinski, Leonard F.; Larson, Loren C., eds. (1985). The William Lowell Putnam Mathematical Competition Problems and Solutions 1965–1984. Mathematical Association of America. pp. 141–142. ISBN 0-88385-463-5. OCLC 55235548.
- "The Mathematical Association of America's William Lowell Putnam Competition". Mathematical Association of America. Archived from the original on 21 April 2006. Retrieved 2006-04-25.
Individual Putnam Fellows: Arthur L. Rubin, California Institute of Technology
- Gallian, Joseph. "The Putnam Competition from 1938-2009" (PDF). Archived from the original (PDF) on 2009-10-13. Retrieved 2015-09-22.
- Greitzer, S (March 1973). "The First U.S.A Mathematical Olympiad". American Mathematical Monthly. Mathematical Association of America. 80 (3): 276–281. doi:10.2307/2318449. JSTOR 2318449.
- Stingley, Jim (May 13, 1974). "Caltech Math Whiz". Los Angeles Times. pp. D1–D2. Alternate Link via ProQuest. Reprinted and slightly altered in Madison Capital Times on July 6, 1974
- Rubin, Arthur Leonard (1978). Free Algebras in Von Neumann–Bernays–Gödel Set Theory and Positive Elementary Inductions in Reasonable Structures (Ph.D.). California Institute of Technology. OCLC 436995833. (Note: access might be depended on type of library institutional subscription available)
- Erdős, Paul; Rubin, Arthur L. & Taylor, Herbert (1980). "Choosability in graphs" (PDF). Proc. West Coast Conf. on Combinatorics, Graph Theory and Computing (Humboldt State Univ., Arcata, Calif., 1979). Congressus Numerantium. XXVI. pp. 125–157. MR 0593902.