Orbit-stabilizer problems and computing normalizers for polycyclic groups

Journal of Symbolic Computation

Volumn 34, Issue 1, 2002, Pages 1-19

  Eick, Bettina ^a  

^a TECHNICAL UNIVERSITY OF BRAUNSCHWEIG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036657902     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.2002.0540     Document Type: Article

References (18)

1. Baumslag, G., Cannonito, F. B., Robinson, D. J. S., Segal, D. (1991). The algorithmic theory of polycyclic-by-finite groups. J. Algebr., 142, 118-149.
2. Celler, F., Neubüser, J., Wright, C. R. B. (1990). Some remarks on the computation of complements and normalizers in finite soluble groups. Acta Applic. Math., 21, 57-76.
3. Cohen, H. (1995). A Course in Computational Algebraic Number Theory, New York, Springer.
4. Daberkow, M., Fieker, C., Klüners, J., Pohst, M., Roegner, K., Wildanger, K. (1997). Kant V4. J. Symb. Comput., 24, 267-283.
5. Dixon, J. D. (1985). The orbit-stabilizer problem for linear groups. Can. J. Math., 37, 238-259.
6. Eick, B. (2001a). Algorithms for polycyclic groups. Habilitationsschrift, Universität Kassel.
7. Eick, B. (2001b). Computing with infinite polycyclic groups. In Seress, A., Kantor., W. M. eds., Groups and Computation III, DIMACS, 1999, pp. 139-153.
8. Eick, B., Nickel, W. (2000). Polycyclic. A GAP 4 package, see Gap (2000).
9. Eick, B., Ostheimer, G. (2002). On the orbit stabilizer problem for integral matrix actions of polycyclic groups. Math. Comput., to appear.
10. Glasby, S.P., Slattery, M. C. (1990). Computing intersections and normalizers in soluble groups. J. Symb. Comput., 9, 637-651.
11. Lo, E. H. (1998). Finding intersection and normalizer in finitely generated nilpotent groups. J. Symb. Comput., 25, 45-59.
12. Lo, E. H. (1998). A polycyclic quotient algorithm. J. Symb. Comput., 25, 61-97.
13. Ostheimer, G. (1999). Practical algorithms for polycyclic matrix groups. J. Symb. Comput., 28, 361-379.
14. Pohst, M. E. (1993). Computational Algebraic Number Theory, volume 21 of DMV Seminar Series, Birkäuser.
15. Sims, C. C. (1990). Computing the order of a solvable permutation group. J. Symb. Comput., 9, 699-705.
16. Sims, C. C. (1994). Computation with Finitely Presented Groups, Cambridge, Cambridge University Press.
17. The GAP Group, (2000). GAP-Groups, Algorithms and Programming, 4th edn. http://www.gap-system.org.
18. Theißen, H. (1997). Eine Methode zur Normalisatorberechnung in Permutationsgruppen mit Anwendungen in der Konstruktion primitiver Gruppen. Dissertation, RWTH Aachen.