# zbMATH — the first resource for mathematics

Standard generators for $$J_ 3$$. (English) Zbl 0852.20027
Given two representations (by permutations or matrices) of a sporadic simple group it may be difficult to explicitly construct an isomorphism by giving images in the second representation of generators in the first representation. Are there pairs of generators $$(g_1,g_2)$$ of the represented abstract group which are computationally easy to find in a concrete representation and characterized up to (inner) automorphisms by computationally accessible properties? When such standard generators are agreed upon, representatives for conjugacy classes and generators for maximal subgroups may be published as words in these standard generators and then easily computed in a concrete representation of the group. The authors explain how this can be done for the groups $$J_3$$ and $$J_3 : 2$$ in a consistent way and refer to recent work of the second author [J. Algebra 184, 505-515 (1996)] with respect to the other sporadic simple groups.

##### MSC:
 20F05 Generators, relations, and presentations of groups 20-04 Software, source code, etc. for problems pertaining to group theory 20D08 Simple groups: sporadic groups
Cayley; GAP
Full Text:
##### References:
 [1] Cannon, J. J. ”Cayley: A Language for Group Theory’. Computational Group Theory: Proceedings of the London Mathematical Society Symposium. Edited by: Atkinson, M. D. pp.145–183. London: Academic Press. [Cannon 1984] [2] Cannon J. J., An Introduction to MAGMA (1993) [3] Conway J. H., Atlas of Finite Groups: Maximal Subgroups and Ordinary Characters for Simple Groups (1985) · Zbl 0568.20001 [4] Finkelstein L., J. Algebra 30 pp 122– (1974) · Zbl 0325.20010 · doi:10.1016/0021-8693(74)90196-3 [5] Jansen C., An Atlas of Brauer Characters (1995) · Zbl 0831.20001 [6] Parker, R. A. ”The computer calculation of modular characters (The ’Meat-axe’)’. Computational Group Theory: Proceedings of the London Mathematical Society Symposium. Edited by: Atkinson, M. D. pp.267–274. London: Academic Press. [Parker 1984] [7] Schönert M., GAP: Groups, Algorithms, and Programming (1994) [8] Suleiman I. A. I., ”A computerised library of sporadic groups’ [9] Walsh P. G., M. Phil, thesis, in: ”Standard generators of some sporadic simple groups’ (1994) [10] Wilson R. A., J. London Math. Soc. 32 pp 460– (1985) · Zbl 0562.20006 · doi:10.1112/jlms/s2-32.3.460 [11] Wilson R. A., J. Symbol. Comp. 10 pp 647– (1990) · Zbl 0721.20009 · doi:10.1016/S0747-7171(08)80163-0 [12] Wilson R. A., J. Symbol. Comp. 15 pp 325– (1993) · Zbl 0797.20015 · doi:10.1006/jsco.1993.1023 [13] Wilson R. A., ”Standard generators for sporadic simple groups’ · Zbl 0855.20034
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.