Computing Subgroups by Exhibition in Finite Solvable Groups

Journal of Symbolic Computation - Tập 33 - Trang 129-143 - 2002
Bettina Eick1
1Institut für Geometrie, Universität Braunschweig, 38106 Braunschweig, Germany

Tài liệu tham khảo

J. Cannon, C. R. Leedham-Green, 1993, Special presentations of finite soluble groups. Unpublished Carter, 1967, The F -normalizers of a finite soluble group, J. Algebr., 5, 175, 10.1016/0021-8693(67)90034-8 Celler, 1990, Some remarks on the computation of complements and normalizers in finite soluble groups, Acta Applic. Math., 21, 57, 10.1007/BF00053292 Doerk, 1992 Eick, 1997, Special presentations for finite soluble groups and computing (pre-)Frattini subgroups Gaschütz, 1963, Zur Theorie der endlichen auflösbaren Gruppen, Math. Z., 80, 300, 10.1007/BF01162386 Laue, 1984, Algorithms for finite soluble groups and the sogos system, 105 Niemeyer, 1994, A finite soluble quotient algorithm, J. Symb. Comput., 18, 541, 10.1006/jsco.1994.1064 Plesken, 1987, Towards a soluble quotient algorithm, J. Symb. Comput., 4, 111, 10.1016/S0747-7171(87)80060-3 Schönert, 1995 Sims, 1990, Computing the order of a solvable permutation group, J. Symb. Comput., 9, 699, 10.1016/S0747-7171(08)80083-1 Sims, 1994 Wright, 1973, An internal approach to covering groups, J. Algebr., 25, 128, 10.1016/0021-8693(73)90081-1 Wright, 1973, On internal formation theory, Math. Z., 134, 1, 10.1007/BF01219089