Learn More
We describe in some detail an algorithm which is an important ingredient in the performance of programs for working with descriptions of groups of prime-power order. It is an algorithm for computing a useful power-commutator presentation for the p-covering group of a group given by a power-commutator presentation. We prove that the algorithm is correct and(More)
This paper describes algorithms for the computation of conjugacy classes of maximal subgroups and the Wyckoo positions of a space group. The algorithms are implemented in the computational group theory system GAP and use existing standard functions of GAP as well as some simple but useful group theoretical ideas. Synopsis: Algorithms for the computation of(More)
  • 1