Steven Kleiman

Steven Lawrence Kleiman (born March 31, 1942) is an American mathematician.

Steven Kleiman
Born
Steven Lawrence Kleiman

(1942-03-31) March 31, 1942
Alma materMassachusetts Institute of Technology, Harvard University
Scientific career
FieldsMathematics
InstitutionsMassachusetts Institute of Technology
Doctoral advisorOscar Zariski
Doctoral students

Professional career

Kleiman is a Professor of Mathematics at the Massachusetts Institute of Technology. Born in Boston, he did his undergraduate studies at MIT. He received his Ph.D. from Harvard University in 1965, after studying there with Oscar Zariski and David Mumford, and joined the MIT faculty in 1969.[1] Kleiman held the prestigious NATO Postdoctoral Fellowship (1966-1967), Sloan Fellowship (1968), and Guggenheim Fellowship (1979).

Contributions

Kleiman is known for his work in algebraic geometry and commutative algebra. He has made seminal contributions in motivic cohomology, moduli theory, intersection theory and enumerative geometry. A 2002 study of 891 academic collaborations in enumerative geometry and intersection theory covered by Mathematical Reviews found that he was not only the most prolific author in those areas, but also the one with the most collaborative ties, and the most central author of the field in terms of closeness centrality; the study's authors proposed to name the collaboration graph of the field in his honor.[2]

Awards and honors

In 1989 the University of Copenhagen awarded him an honorary doctorate[3] and in May 2002 the Norwegian Academy of Science and Letters hosted a conference in honor of his 60th birthday and elected him as a foreign member.[4] In 1992 Kleiman was elected foreign member of the Royal Danish Academy of Sciences and Letters.

In 2012 he became a fellow of the American Mathematical Society.[5] He was an invited speaker at the International Congress of Mathematics at Nice in 1970.[6]

Selected publications

  • Kleiman, Steven L. (1966), "Toward a numerical theory of ampleness", Annals of Mathematics, Second Series, 84 (3): 293–344, doi:10.2307/1970447, JSTOR 1970447.
  • Kleiman, S. L. (1968), Algebraic cycles and Weil conjectures. Dix exposés sur la cohomologie des schémas, North-Holland, Amsterdam; Masson, Paris, pp. 359–386.
  • Altman, I.; Kleiman, Steven L. (1970), Introduction to Grothendieck duality theory, Springer-Verlag.
  • Kleiman, Steven L. (1974), "The transversality of a general translate", Compositio Mathematica, 28 (3): 287–297.
  • Altman, Allen B.; Kleiman, Steven L. (1980), "Compactifying the Picard scheme", Advances in Mathematics, 35 (1): 50–112, doi:10.1016/0001-8708(80)90043-2.
  • Kleiman, Steven; Thorup, Anders L. (1994), "A geometric theory of the Buchsbaum-Rim multiplicity", Journal of Algebra, 167 (1): 168–231, doi:10.1006/jabr.1994.1182.
  • Gaffney, T.; Kleiman, Steven L. (1999), "Specialization of integral dependence for modules", Inventiones Mathematicae, 137 (3): 541–574, arXiv:alg-geom/9610003, Bibcode:1999InMat.137..541G, doi:10.1007/s002220050335.
gollark: Audiophile types may have a separate "subwoofer" and "tweeter".
gollark: As far as I know speakers generally work better in specific frequency ranges.
gollark: For what purpose?
gollark: One of the ides is the ides of March; it is known (Spurinna, -44) that this is to be feared. This, and their use in bee colonies, means hexagons are among the most fearsome shapes.
gollark: I can start up the demo.

See also

References

  1. Duren, Peter L.; Askey, Richard (1989), A Century of Mathematics in America, American Mathematical Society, p. 543, ISBN 0-8218-0124-4.
  2. Alberich, R.; Miret, J. M.; Miro-Julia, J.; Rosselló, F.; Xambó, S. (2002), The Kleiman graph (PDF).
  3. MIT TechTalk, February 14, 1990.
  4. Reports to the president 2001–2002, MIT Mathematics Dept.; Conference in Honor of Steven Kleiman's 60th Birthday, Dan Grayson, Univ. of Illinois.
  5. List of Fellows of the American Mathematical Society, retrieved January 27, 2013.
  6. International Mathematical Union (IMU)
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.