|
|
Next: Finitely Presented Abelian Groups
Up: Groups
Previous: Finite Soluble Groups
Finitely Presented Groups
New Features:
- An implementation of the Plesken-Fabianska algorithm for determining
whether a fp-group has PSL(2, K), K an algebraic extension of
Q,
as a quotient is included.
- The Homomorphisms function has been extended so that it is now
possible to search for homomorphisms from a finitely-presented group into
a (small) soluble group given by a power-commutator presentation (pc-group).
Code supplied by D.F. Holt.
- Two functions for converting finite finitely presented groups of moderate
cardinality to other types have been added. These are PermutationGroup and
PCGroup.
- Machinery is now provided that allows a user to define automorpisms and
automorphism groups for finitely-presented groups.
- Code has been provided by Derek Holt to construct the automorphism group
of a free group.
Bug Fixes:
- The IsNormal command for fp-groups has been corrected to use the inverses
of the group generators as well as the generators when conjugating, possibly
correcting results for infinite groups.
Next: Finitely Presented Abelian Groups
Up: Groups
Previous: Finite Soluble Groups
|
|
