Arthur Rubin
Template:Short description Script error: No such module "about". Script error: No such module "Template wrapper".Script error: No such module "Check for conflicting parameters". Arthur Leonard Rubin (born 1956)[1] is an American mathematician and aerospace engineer. He was 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 was Herman Rubin, a professor of statistics at the same university.[2] Arthur co-authored his first paper with his mother in 1969 at the age of 13.[3] He earned his Ph.D. at the California Institute of Technology in 1978, under the direction of Alexander S. Kechris.[4]
Rubin unsuccessfully stood as a Libertarian to represent the 55th district in the 1984 California State Assembly elections.[5]
Awards and honors
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.[6][7][8] In 1972, he tied for third place in the first USA Mathematical Olympiad.[9]
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".[10]
Publications
Rubin's dissertation was entitled Free Algebras in Von Neumann–Bernays–Gödel Set Theory and Positive Elementary Inductions in Reasonable Structures.[4][11] In 1979, Rubin co-authored a paper on list coloring of graphs with Paul Erdős, giving him an Erdős number of 1.[12]
- Page Module:Citation/CS1/styles.css has no content.Rubin, A. L. & Rubin, J. E. (1969). "Extended operations and relations on the class of ordinal numbers". Fundamenta Mathematicae. 65 (2): 227–242. doi:10.4064/fm-65-2-227-242.
- Page Module:Citation/CS1/styles.css has no content.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. S2CID 18138945.
- Page Module:Citation/CS1/styles.css has no content.Posner, E. C. & Rubin, A.L. (1984). "Capacity of digital links in tandem". IEEE Transactions on Information Theory. IT-30 (3): 464–470. Bibcode:1984ITIT...30..464P. doi:10.1109/TIT.1984.1056917.
- Page Module:Citation/CS1/styles.css has no content.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.
References
Page Template:Reflist/styles.css has no content.
- ^ Page Module:Citation/CS1/styles.css has no content.Bock, M. E. (2004), "Conversations with Herman Rubin", in DasGupta, Anirban (ed.), A Festschrift for Herman Rubin, Lecture notes – monograph series, vol. 45, Institute of Mathematical Statistics, pp. 408–417, ISBN 9780940600614, JSTOR 4356327.
- ^ Page Module:Citation/CS1/styles.css has no content.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.
- ^ Page Module:Citation/CS1/styles.css has no content.Rubin, A. L. & Rubin, J. E. (1969). "Extended operations and relations on the class of ordinal numbers". Fundamenta Mathematicae. 65 (2): 227–242. doi:10.4064/fm-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)
- ^ a b Arthur Rubin at the Mathematics Genealogy ProjectTemplate:EditAtWikidata
- ^ Page Module:Citation/CS1/styles.css has no content.Ward, Mike (June 3, 1984). "Most Senators, Assemblymen Unchallenged". Los Angeles Times. Template:ProQuest. Archived from the original on November 4, 2012.
- ^ Page Module:Citation/CS1/styles.css has no content.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.
- ^ Page Module:Citation/CS1/styles.css has no content."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.
- ^ Page Module:Citation/CS1/styles.css has no content.Gallian, Joseph. "The Putnam Competition from 1938-2009" (PDF). Archived from the original (PDF) on 2009-10-13. Retrieved 2015-09-22.
- ^ Page Module:Citation/CS1/styles.css has no content.Greitzer, S (March 1973). "The First U.S.A Mathematical Olympiad". American Mathematical Monthly. 80 (3). Mathematical Association of America: 276–281. doi:10.2307/2318449. JSTOR 2318449.
- ^ Page Module:Citation/CS1/styles.css has no content.Stingley, Jim (May 13, 1974). "Caltech Math Whiz". Los Angeles Times. pp. D1–D2. Template:ProQuest. Reprinted and slightly altered in Madison Capital Times on July 6, 1974
- ^ Page Module:Citation/CS1/styles.css has no content.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. Template:ProQuest. (Note: access might be depended on type of library institutional subscription available)
- ^ Page Module:Citation/CS1/styles.css has no content.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. Vol. XXVI. pp. 125–157. MR 0593902.
Lua error in package.lua at line 80: module 'Module:Authority control/config' not found.
