Description

Many newer algorithms reduce to the case of an almost simple group. Furthermore much information is known about these groups. To do this in practice, however, one needs

• constructive recognition routines for the various types of groups
• stored information about the groups
• A ``default'' mechanism for transferring information.

Some rountines have been (at least partially) implemented, the library of tables of marks also contains much information about subgroups.

Getting complete information for all simple groups is likely to be beyond one persons scope, a reasonable goal would be to provide routines and data for single series of groups or all almost simple groups up to size 1 million.

References

• R. A. Wilson, J. Algebra {\bf 184} (1996), no.~2, 505--515; MR 98e:20025
• F. Celler\ and\ C. R. Leedham-Green, in {\it The atlas of finite groups: ten years on (Birmingham, 1995)}, 11--26, Cambridge Univ. Press, Cambridge, 1998; MR 99g:20001
• G. Cooperman, L. Finkelstein\ and\ S. Linton, in {\it Groups and computation, II (New Brunswick, NJ, 1995)}, 85--100, Amer. Math. Soc., Providence, RI, 1997; MR 98d:20054
• W. M. Kantor\ and\ \'A. Seress, Mem. Amer. Math. Soc. {\bf 149} (2001), no.~708, viii+168 pp.; CNO 1 804 385

Remarks

GAP home page