Polycyclic : a GAP 4 package - References

[BCRS91]

G. Baumslag, F.B. Cannonito, D.J.S. Robinson, and D. Segal.
The algorithmic theory of polycyclic-by-finite groups.
J. Alg., 142:118 -- 149, 1991.

[Eic00]

B. Eick.
Computing with infinite polycyclic groups.
In Groups and Computation III, Amer. Math. Soc. DIMACS Series. (DIMACS, 1999), 2000.

[Hir38b]

K.A. Hirsch.
On infinite soluble groups (I).
Proc. London Math. Soc., 44(2):53--60, 1938.

[Hir38a]

K.A. Hirsch.
On infinite soluble groups (II).
Proc. London Math. Soc., 44(2):336--414, 1938.

[Hir46]

K.A. Hirsch.
On infinite soluble groups (III).
J. London Math. Soc., 49(2):184--94, 1946.

[Hir52]

K.A. Hirsch.
On infinite soluble groups (IV).
J. London Math. Soc., 27:81--85, 1952.

[Hir54]

K.A. Hirsch.
On infinite soluble groups (V).
J. London Math. Soc., 29:250--251, 1954.

[LS90]

C[harles] R. Leedham-Green and L[eonard] H. Soicher.
Collection from the left and other strategies.
J. Symbolic Comput., 9(5 & 6):665--675, 1990.

[Rob82]

D.J. Robinson.
A Course in the Theory of Groups, volume 80 of Graduate Texts in Math.
Springer-Verlag, New York, Heidelberg, Berlin, 1982.

[Seg83]

D. Segal.
Polycyclic Groups.
Cambridge University Press, Cambridge, 1983.

[Seg90]

D. Segal.
Decidable properties of polycyclic groups.
Proc. London Math. Soc. (3), 61:497--528, 1990.

[Sims94]

C. C. Sims.
Computation with Finitely Presented Groups.
Cambridge University Press, 1994.

[Up]