Richard A. Parker

 
Wikipedia:

Richard A. Parker

For the egyptologist Richard A. Parker, see Richard Anthony 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 213 (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, J. H.; Curtis, R. T.; Norton, S. P.; Parker, R. A.; and Wilson, R. A.: "Atlas of Finite Groups: Maximal Subgroups and Ordinary Characters for Simple Groups." Oxford, England 1985.
  • 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

External links


Search unanswered questions...
Search our library...
Questions Reference
 
 

Join the WikiAnswers Q&A community. Post a question or answer questions about "Richard A. Parker" at WikiAnswers.

 

Copyrights:

Wikipedia. This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Richard A. Parker" Read more

 

Mentioned in