> < ^ Date: Thu, 16 Sep 1993 19:44:57 +0200
> < ^ From: Joachim Neubueser <joachim.neubueser@math.rwth-aachen.de >
< ^ Subject: Re: solvable factor group

In a letter of last Friday Ruth Schwingel asked:
> I'm studying Alexander Wegner's dissertation entitled
> "Implementation eines Algorithmus zur Berechnung endlicher
> aufl"osbarer Faktorgruppen einer endlich pr"asentierten
> Gruppe im gruppentheoretischen Programmsystem GAP".
> But apparently, this algorithm is not implemented in GAP-3.2.
> I would like to know if there is such algorithm that computes
> finite solvable factor groups of a finitely presented group
> implemented in any other system.

Alexander Wegner's Soluble Quotient program, following W. Plesken's
proposal, was implemented for GAP 2.4, it did not get included into
this and the later versions so far, however right now work is going on
to modify it slightly and to make it available with the then latest
version of GAP. Prior to full integration and soon we hope to provide
a separate file with this program for extensive testing.

Another Soluble Quotient using completely different methods and
involving Steve Linton's Module Enumerator has been written by Alice
Niemeyer in Canberra. She plans to make it available both as a
standalone and as a share library with GAP also in the near future.

No dates promised for both, but near future is hoped to mean what it
says in both cases!! Availability of both will be announced in the

Charles Sims has written an experimental version of a Metabelian
Quotient in connection with his paper on implementing the Baumslag-
Cannonito-Miller algorithm, however this is not publicly available.

I do not know of a Soluble Quotient in any other system, sorry.

Joachim Neubueser

> < [top]