Theodore Motzkin

From Wikipedia, the free encyclopedia
Theodore Motzkin
Born(1908-03-26)March 26, 1908
Berlin, Germany
DiedOctober 15, 1970(1970-10-15) (aged 62)
NationalityAmerican
Alma materUniversity of Basel
Known for
Motzkin number
PIDs that are not EDs
Linear programming
Fourier–Motzkin elimination
Scientific career
InstitutionsUCLA
Doctoral advisorAlexander Ostrowski
Doctoral studentsJohn Selfridge
Rafael Artzy

Theodore Samuel Motzkin (26 March 1908 – 15 December 1970) was an Israeli-American mathematician.[1]

Biography[]

Motzkin's father Leo Motzkin, a Ukrainian Jew, went to Berlin at the age of thirteen to study mathematics. He pursued university studies in the topic and was accepted as a graduate student by Leopold Kronecker, but left the field to work for the Zionist movement before finishing a dissertation.[2]

Motzkin grew up in Berlin and started studying mathematics at an early age as well, entering university when he was only 15.[2] He received his Ph.D. in 1934 from the University of Basel under the supervision of Alexander Ostrowski[3] for a thesis on the subject of linear programming[2] (Beiträge zur Theorie der linearen Ungleichungen, "Contributions to the Theory of Linear Inequalities", 1936[4]).

In 1935, Motzkin was appointed to the Hebrew University in Jerusalem, contributing to the development of in Hebrew.[4] In 1936 he was an Invited Speaker at the International Congress of Mathematicians in Oslo.[5] During World War II, he worked as a cryptographer for the British government.[2]

In 1948, Motzkin moved to the United States. After two years at Harvard and Boston College, he was appointed at UCLA in 1950, becoming a professor in 1960.[4] He worked there until his retirement.[2]

Motzkin married Naomi Orenstein in Jerusalem. The couple had three sons:

  • Aryeh Leo Motzkin - Orientalist
  • Gabriel Motzkin - philosopher
  • Elhanan Motzkin - mathematician

Contributions to mathematics[]

Motzkin's dissertation contained an important contribution to the nascent theory of linear programming (LP), but its importance was only recognized after an English translation appeared in 1951. He would continue to play an important role in the development of LP while at UCLA.[4] Apart from this, Motzkin published about diverse problems in algebra, graph theory, approximation theory, combinatorics, numerical analysis, algebraic geometry and number theory.[4]

The , Motzkin numbers and the Fourier–Motzkin elimination are named after Theodore Motzkin. He first developed the "double description" algorithm of polyhedral combinatorics and computational geometry.[6] He was the first to prove the existence of principal ideal domains that are not Euclidean domains, being his first example.

Motzkin found the first explicit example of a nonnegative polynomial which is not sum of squares, known as the Motzkin polynomial X4Y2 + X2Y4 − 3X2Y2 + 1.[7]

The quote "complete disorder is impossible," describing Ramsey theory is attributed to him.[8]

See also[]

References[]

  1. ^ Motzkin, Theodore S. (1983). David Cantor; Basil Gordon; Bruce Rothschild (eds.). Theodore S. Motzkin: Selected papers. Contemporary Mathematicians. Boston, Mass.: Birkhäuser. pp. xxvi+530. ISBN 3-7643-3087-2. MR 0693096.
  2. ^ Jump up to: a b c d e O'Connor, John J.; Robertson, Edmund F., "Theodore Motzkin", MacTutor History of Mathematics archive, University of St Andrews
  3. ^ Theodore Motzkin at the Mathematics Genealogy Project
  4. ^ Jump up to: a b c d e Joachim Schwermer (1997). "Motzkin, Theodor Samuel". Neue Deutsche Biographie. 18. pp. 231 ff.
  5. ^ Motzkin, Th. (1936). "Sur le produit des spaces métriques". In: Congrès International des Mathématiciens. pp. 137–138.
  6. ^ Motzkin, T. S.; Raiffa, H.; Thompson, G. L.; Thrall, R. M. (1953). "The double description method". Contributions to the theory of games. Annals of Mathematics Studies. Princeton, N. J.: Princeton University Press. pp. 51–73. MR 0060202.
  7. ^ T. S. Motzkin, The arithmetic-geometric inequality. 1967 Inequalities (Proc. Sympos. Wright-Patterson Air Force Base, Ohio, 1965) pp. 205–224.
  8. ^ Hans Jürgen Prömel (2005). "Complete Disorder is Impossible: The Mathematical Work of Walter Deuber". Combinatorics, Probability and Computing. Cambridge University Press. 14: 3–16. doi:10.1017/S0963548304006674.
Retrieved from ""