Computing maximal subgroups of finite groups

Abstract We describe a practical algorithm for computing representatives of the conjugacy classes of maximal subgroups in a finite group, together with details of its implementation for permutation groups in the MAGMA system. We also describe methods for computing complements of normal subgroups and minimal supplements of normal soluble subgroups of finite groups.

[1]  Alexander Hulpke,et al.  Konstruktion transitiver Permutationsgruppen , 1996 .

[2]  Cheryl E. Praeger,et al.  On minimal faithful permutation representations of finite groups , 2000, Bulletin of the Australian Mathematical Society.

[3]  Hans Zassenhaus,et al.  Über einen Algorithmus zur Bestimmung der Raumgruppen , 1948 .

[4]  Sergey Bratus,et al.  Fast Constructive Recognition of a Black Box Group Isomorphic to Sn or An using Goldbach's Conjecture , 2000, J. Symb. Comput..

[5]  William R. Unger.  Computing the soluble radical of a permutation group , 2006 .

[6]  John J. Cannon,et al.  Special polycyclic generating sequences for finite soluble groups , 2004, J. Symb. Comput..

[7]  D. F. Holt.  EMBEDDINGS OF GROUP EXTENSIONS INTO WREATH PRODUCTS , 1978 .

[8]  L. G. Kovács,et al.  Maximal subgroups in composite finite groups , 1986 .

[9]  W. Kantor,et al.  Groups and Computation II , 1997 .

[10]  L. G. Kovács,et al.  On normal subgroups which are direct products , 1984 .

[11]  Derek F. Holt,et al.  Computing the Subgroups of a Permutation Group , 2001, J. Symb. Comput..

[12]  J. Neubüser,et al.  Groups – St Andrews 1981: An elementary introduction to coset table methods in computational group theory , 1982 .

[13]  William M. Kantor,et al.  Black Box Classical Groups , 2001 .

[14]  Gregory Butler,et al.  Fundamental Algorithms for Permutation Groups , 1991, Lecture Notes in Computer Science.

[15]  C. Wright,et al.  Some remarks on the computation of complements and normalizers in soluble groups , 1990 .

[16]  Á. Seress.  An Introduction to Computational Group Theory , 1997 .

[17]  Bettina Eick.  Special presentations for finite soluble groups and computing(pre-) Frattini subgroups , 1995, Groups and Computation.

[18]  John J. Cannon,et al.  The Magma Algebra System I: The User Language , 1997, J. Symb. Comput..

[19]  Derek F. Holt,et al.  Automorphism group computation and isomorphism testing in finite groups , 2003, J. Symb. Comput..

[20]  Derek F. Holt.  REPRESENTING QUOTIENTS OF PERMUTATION GROUPS , 1997 .

[21]  Bettina Eick,et al.  Computing the maximal subgroups of a permutation group I , 2001 .

[22]  Leonard L. Scott,et al.  Maximal subgroups of finite groups , 1985 .