Part of the Mathematics and Its Applications book series (MAIA, volume 325)
The Art and Science of Computing in Large Groups
This paper describes general approaches and some specific techniques that enable researchers to perform computations in groups too large for general-purpose software and algorithms.
KeywordsConjugacy Class Maximal Subgroup Structure Constant Permutation Group Dihedral Group
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- D. J. Benson, The Simple Group J4, PhD thesis, Cambridge, 1981.Google Scholar
- S. A. Linton, The Maximal Subgroups of the Sporadic Groups Th, Fi24 and Fi’ 24 and Other Topics, PhD thesis, Cambridge, 1989.Google Scholar
- [91.J. Neuböser, H. Pahlings and W. Plesken, CAS; Design and Use of a System for the Handling of Characters of Finite Groups, in “Computational Group Theory” ed. M. Atkinson, 195–248, New York: Academic Press, 1984.Google Scholar
- M. Schönert et al, GAP — Groups, Algorithms and Programming, Lehrstuhl D für Mathematik, RWTH-Aachen, 1992.Google Scholar
- Charles C. Sims, How to Construct a Baby Monster, in: M. J. Collins (ed.), Finite Simple Groups II, New York: Academic Press 1980, 339–345.Google Scholar
- R. A. Wilson, The Action of a Maximal Parabolic Subgroup on the Transpositions of the Baby Monster, Proc. Edinburgh Math. Soc. 37 (1993), 185–189.Google Scholar
- R. A. Wilson, Maximal Subgroups of Sporadic Simple Groups, in: C. M. Campbell and E. F. Robertson (eds), Proceedings of Groups — St. Andrews, 1985, London Math. Soc. Lecture Notes Series 121, Cambridge: Cambridge University Press, 1986, 352–258.Google Scholar
© Springer Science+Business Media Dordrecht 1995