Next: Lattices
Up: Groups
Previous: Quasisimple Groups
Soluble Groups
New Features:
- A package for the more efficient calculation of the automorphism
group of a finite soluble group G
is included. The algorithm
was developed by David Howden and works by extending the automorphisms
of a large Sylow p
-subgroup of G
to the automorphism group of G
.
A slight variation of the algorithm may be used to test isomorphism.
The relevant intrinsics are
AutomorphismGroupSolubleGroup and IsIsomorphicSolubleGroup.
- Intrinsics OrbitStabilizer for computing orbit and stabilizer
of an element under the action of a finite soluble group has been added.
The intrinsic IsConjugate is extended to take advantage of the
data computed by OrbitStabilizer.
Next: Lattices
Up: Groups
Previous: Quasisimple Groups