Charles Sims

from Wikipedia, the free encyclopedia
Charles Sims in Oberwolfach 2006

Charles Coffin Sims (born April 14, 1937 in Elkhart , Indiana , † October 23, 2017 in Saint Petersburg , Florida ) was an American mathematician who studied finite groups .

Sims received his PhD from Harvard University in 1963 with John Griggs Thompson (Enumeration of p-groups). He taught as a professor at Rutgers University , where he had been since 1965. From 1982 to 1984 he was chairman of the mathematics faculty there. In 2007 he retired and lived in Saint Petersburg (Florida).

Sims was a pioneer in algorithmic group theory, where he is known among other things for the Schreier-Sims algorithm (named after him and Otto Schreier ) from 1970. Together with Donald G. Higman, he discovered the Higman Sims group, a sporadic group , and using the permutation group software he had developed, he proved the existence of further sporadic groups, the Lyons group ( assumed by Richard Lyons 1970) and the O ' Nan group ( assumed by Michael O'Nan in 1976), both of which are sometimes also named after Sims. With Jeffrey Leon he constructed the baby monster group .

He was a fellow of the American Mathematical Society . In 1969 he received a research grant from the Alfred P. Sloan Foundation ( Sloan Research Fellowship ).

Web links

Individual evidence

  1. Obituary , accessed on November 3, 2017, or 1938 with source Wikipedia from Ronan's website about mathematicians doing research on finite groups
  2. Blog entry by Peter Cameron from October 25, 2017 (accessed November 1, 2017)
  3. Sims Computational methods in the study of permutation groups , in Computational Problems in Abstract Algebra , Pergamon Press, Oxford, 1970, pp. 169-183
  4. ^ Higman, Sims A simple group of order 44.352.000 , Mathematische Zeitschrift, Vol. 105, 1968, p. 110