Richard A. Parker Explained

Richard A. Parker (29 January 1953 – 26 January 2024^[1]) was a mathematician and freelance computer programmer born in Surrey who lived for much of his life 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 anddeep holes of the Leech lattice, and constructed Parker's Moufang loop of order 2^13[2] (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. .

• Book: Conway . John Horton . John Horton Conway . Curtis . Robert Turner . Norton . Simon Phillips . Simon P. Norton . Parker . Richard A . Richard A. Parker . Wilson . Robert Arnott . Robert Arnott Wilson . Atlas of finite groups: maximal subgroups and ordinary characters for simple groups . ATLAS of Finite Groups . 1985 . Oxford University Press . 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)

Notes and References

1. Web site: Richard Parker Memorial. 2024-02-05.
2. Book: Wilson, Robert. The Finite Simple Groups. 5 August 2012. 2009. Springer. 9781848009875. 247.