George Glauberman
From Wikipedia, the free encyclopedia
George Glauberman (born 1941, New York City) is a mathematician at the University of Chicago who works on finite simple groups. He proved the ZJ theorem and the Z* theorem.
Glauberman did his undergraduate studies at the Polytechnic Institute of Brooklyn, graduating in 1961, and earned a masters degree from Harvard University in 1962.[1] He obtained his Ph.D. degree from the University of Wisconsin–Madison in 1965, under the supervision of Richard Bruck.[2] He has had 22 Ph.D. students, including Ahmed Chalabi and Peter Landrock, the president and founder of Cryptomathic. He has co-authored with J. L. Alperin, Simon P. Norton, and Zvi Arad.
In 2012 he became a fellow of the American Mathematical Society.[3]
Selected publications
- Glauberman, George (1964), "On loops of odd order", Journal of Algebra 1: 374–396, doi:10.1016/0021-8693(64)90017-1, ISSN 0021-8693, MR 0175991
- Glauberman, George (1966), "Central elements in core-free groups", Journal of Algebra 4: 403–420, doi:10.1016/0021-8693(66)90030-5, ISSN 0021-8693, MR 0202822, Zbl 0145.02802
- Glauberman, George (1968), "A characteristic subgroup of a p-stable group", Canadian Journal of Mathematics 20: 1101–1135, ISSN 0008-414X, MR 0230807
- Glauberman, George (1968), "Correspondences of characters for relatively prime operator groups.", Canadian Journal of Mathematics 20: 1465–1488, ISSN 0008-414X, MR 0232866
- Glauberman, George (1968), "On loops of odd order. II", Journal of Algebra 8: 393–414, doi:10.1016/0021-8693(68)90050-1, ISSN 0021-8693, MR 0222198
- Bender, Helmut; Glauberman, George (1994), Local analysis for the odd order theorem, London Mathematical Society Lecture Note Series 188, Cambridge University Press, ISBN 978-0-521-45716-3, MR 1311244
References
- ↑ Curriculum vitae, retrieved 2013-07-21.
- ↑ George Glauberman at the Mathematics Genealogy Project
- ↑ List of Fellows of the American Mathematical Society, retrieved 2013-01-19.
External links
|
This article is issued from Wikipedia. The text is available under the Creative Commons Attribution/Share Alike; additional terms may apply for the media files.