… algorithm to compute polycyclic quotients of a group given by a finite presentation is discussed.
The algorithm … to the integral group ring of a polycyclic group. Most of this material can be …

… I have no idea if there is any chance to program these, but given that no one in 1981
would have guessed that the polycyclic quotient algorithm had a prayer of being realized on …

… The second approach is to use computer methods to compute G ⊗ G by computing a consistent
polycyclic presentation of ν(G) using a polycyclic quotient algorithm and then computing …

… We describe a new algorithm to compute polycyclic presentations for (possibly infinite)
polycyclic quotients of finitely presented groups. We also describe a first implementation …

… an algorithm described by Baumslag, Cannonito, and Miller for computing polycyclic quotients
… for computing nilpotent quotients. Some experimentation with computing class-2 nilpotent …

… normal closure of a subgroup of G, finding generating sets for the terms in the lower central
series of G, and finding a consistent polycyclic presentation for a subgroup or a quotient of G. …

… We describe effective algorithms for computing a polycyclic … square of a polycyclic group
given by a polycyclic presentation. … ∗ and a consistent polycyclic presentation for its quotient G …

… polycyclic presentation for the quotient G/γn(G). As above, let F be the free group on S. We
first determine a group H defined by a consistent polycyclic … a nilpotent quotient algorithm for …

… which decides whether a soluble group given by a finite presentation is polycyclic. It has
been … Polycyclic presentations for finite soluble groups are better known as power conjugate …

… polycyclic-by-finite group as an extension of a polycyclic group by a finite group, the algorithms
… decompositions in which the finite quotient admits a faithful permutation representation of …