Richard A. Parker

From Wikipedia, the free encyclopedia

For the Egyptologist Richard A. Parker, see Richard Anthony Parker.

Richard A. Parker

Richard A. Parker (b. 29 January 1953, in Surrey) is a mathematician and freelance computer programmer in Cambridge, England. He invented many of the algorithms for computing the modular character tables of finite simple groups. He discovered the relation between Niemeier lattices and deep holes of the Leech lattice, and constructed Parker's Moufang loop of order 2¹³^[1] (which was used by John Horton Conway in his construction of the monster group).

Books

Conway, J. H.; Sloane, N. J. A. (1999). Sphere packings, lattices and groups. (3rd ed.) With additional contributions by E. Bannai, R. E. Borcherds, John Leech, Simon P. Norton, A. M. Odlyzko, R. A. Parker, L. Queen and B. B. Venkov. Grundlehren der Mathematischen Wissenschaften, 290. New York: Springer-Verlag. ISBN 0-387-98585-9.
Conway, John Horton; Curtis, Robert Turner; Norton, Simon Phillips; Parker, Richard A; Wilson, Robert Arnott (1985). Atlas of finite groups: maximal subgroups and ordinary characters for simple groups. Oxford University Press. ISBN 0-19-853199-0.
An Atlas of Brauer Characters (London Mathematical Society Monographs) by Christopher Jansen, Klaus Lux, Richard Parker, Robert Wilson. Oxford University Press, U.S. (October 1, 1995) ISBN 0-19-851481-6

References

↑ Wilson, Robert (2009). The Finite Simple Groups. Springer. p. 247. ISBN 9781848009875. Retrieved 5 August 2012.

Persondata
Name	Parker, Richard A.
Alternative names
Short description	British mathematician
Date of birth	29 January 1953
Place of birth
Date of death
Place of death

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.