A nilpotent quotient algorithm for L-presented groups

Abstract

The main part of this paper contains a description of a nilpotent quotient algorithm for L-presented groups and a report on applications of its implementation in the computer algebra system GAP. The appendix introduces two new infinite series of L-presented groups. Apart from being of interest in their own right, these new L-presented groups serve as examples for applications of the nilpotent quotient algorithm.

References in corpus (2)

• Amenability via random walks
• Iterated Monodromy Groups of Quadratic Polynomials, I

Cited by in corpus (3)

• The Twisted Twin of the Grigorchuk Group
• Restricted Hausdorff spectra of $q$-adic automorphisms
• Remarks and problems about algorithmic descriptions of groups