Introduction
Arthur Leonard Rubin (born 1956) is an American mathematician and aerospace engineer, most notable for being named a Putnam Fellow on four consecutive occasions from 1970 to 1973.
Life and career
Rubin's mother was Jean E. Rubin, a professor of mathematics at Purdue University and his father, Herman Rubin, a professor of statistics at the same university. He earned his Ph.D. at the California Institute of Technology in 1978, under the direction of Alexander S. Kechris.
Rubin unsuccessfully stood as a Libertarian to represent the 55th district in the 1984 California State Assembly elections.
Awards and honors
Rubin published his first paper in 1969 at the age of 13. 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. A Putnam fellowship is awarded to the five highest ranked scorers in the William Lowell Putnam Mathematical Competition, an annual competition for undergraduate college students enrolled at institutions of higher learning in the United States and Canada. 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 is quoted as saying that someone of Rubin's ability appeared in the United States "about once in every ten years".
Publications
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 fur 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.
- "Arthur Rubin". Mathematics Genealogy Project. OCLC 436995833. Retrieved 2006-12-16.
- 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". Proc. West Coast Conf. on Combinatorics, Graph Theory and Computing (Humboldt State Univ., Arcata, Calif., 1979) (PDF). Congressus Numerantium. XXVI. pp. 125–157. MR 0593902.