George Minty

from Wikipedia, the free encyclopedia

George James Minty (born September 16, 1929 in Detroit , † August 6, 1986 in Bloomington , Indiana ) was an American mathematician who worked in the fields of analysis and discrete mathematics .

Life

The beginning of Minty's article Monotone (nonlinear) operators in Hilbert space from 1962

George Minty grew up in Detroit. His father had emigrated from Scotland to the United States after World War I and worked in Detroit as a toolmaker in the automotive industry . George Minty studied at Wayne State University in Detroit, worked for a time as a teacher and learned the application of mathematics in electronics during his army service with the US Army Signal Corps in Fort Monmouth .

After studying mathematics at the University of Michigan , he received his doctorate in 1959 with a thesis on the mathematics of thermodynamics . His doctoral supervisor was Erich Rothe .

Minty worked in the development laboratory of General Motors in the field of electronics and solved problems there with graph theoretic methods (see under writings, for example, his work, which appeared in 1966). From 1965 he was a professor at Indiana University , where he worked until his death in 1986. In 1965 he received a research grant from the Alfred P. Sloan Foundation ( Sloan Research Fellowship ).

George Minty worked on monotonic operators in the field of functional analysis . The theory of monotonous operators was founded by Minty, and independently of him by Felix Browder . Minty-Browder's phrase is named after both . Minty is also known for his contribution with Victor Klee in the field of optimization : her work from 1972 shows that the simplex algorithm , an optimization method in discrete mathematics, has exponential running time . The example they designed for this is now also called the Klee-Minty Cube .

Fonts

  • Doctoral thesis: Integrability Conditions for Vector Fields in Banach Spaces , 1959
  • Monotone networks , Proc. Royal Soc. London 257 , 194-212, 1960
  • Monotonic (nonlinear) operators in Hilbert space , Duke Math. J. 29 , 341-346, 1962
  • On the axiomatic foundations of the theories of directed linear graphs, electrical networks and network programming , J. Math. Mech. 15 , 485-520, 1966
  • (with Victor Klee ) How good is the simplex algorithm? , Inequalities III, Proc. 3rd Symp., Los Angeles 1969, 159-175, 1972
  • On maximally independent sets of vertices in claw-free graphs , J. Comb. Theory, Ser. B 28 , 284-304, 1980

Web links

Individual evidence

  1. ^ Biographical data from Minutes of the Board of Trustees of Indiana University, September 6, 1986
  2. Most of the remaining information comes from Andrew Lenard's report on the Historia Matematica Mailing List.
  3. See Minutes of the Board of Trustees of Indiana University, May 21, 1965
  4. ^ The book I have a photographic memory by Paul Halmos (American Mathematical Society, 1987) contains a Photo Mintys.