There are a variety of algorithms to compute conjugacy classes and centralizers in solvable groups via epimorphic images (FelschNeubueser79,MeckyNeubueser89,Theissen93). Usually these are only invoked as methods, but it is possible to access the algorithm directly.
@The syntax of this function may change in a future rewrite!@
ClassesSolvableGroup( G, mode[, opt] ) F
computes conjugacy classes and centralizers in solvable groups. G is the acting group. mode indicates the type of the calculation:
0 Conjugacy classes
4 Conjugacy test for the two elements in opt.candidates
In mode 0 the function returns a list of records containing components representative and centralizer. In mode 4 it returns a conjugating element.
The optional record opt may contain the following components that will affect the algorithms behaviour:
pcgsNormalSeriesByPcgs must return an
appropriate series of normal subgroups with elementary abelian factors
among them. The algorithm will step down this series. By default an
ElementaryAbelianSeries is used.
candidates^ operator) =representative.
See also SubgroupsSolvableGroup.
[Top] [Previous] [Up] [Index]
GAP 4 manual