The nonabelian tensor square , which came from homotopy theory, of the groups and is the group generated by the symbols and the relations and . By the result of R. D. Blyth and R. F. Morse, if the group is polycyclic then so is the tensor square, and the present paper provides an effective algorithm for computing a consistent polycyclic presentation for the tensor square, with such a presentation for the group given. The group is important in the construction: to the generators of the group a set of new generators is added the same in number, subject to the same relations, and further suitable relations concerning the action of the generators on the commutators between elements of these two sets. The nonabelian tensor square embeds as a normal subgroup into the group with factor the product . Another group is constructed by means of a consistent polycyclic presentation, and the group is a central extension of . Then a consistent polycyclic presentation of the group may be computed by adding new central generators for every relation of the group and modifying those relations in an appropriate way. Finally, the consistent polycyclic presentation of the tensor square may be obtained as the presentation of a subgroup of the group . Moreover, algorithms for computing presentations of certain related other group constructions and for checking whether a polycyclic group is isomorphic to the central factor of some group are also provided.
The algorithms are implemented by the authors in the computer algebra system GAP. The tensor squares are computed for nonabelian groups of order at most 30 up to now, the new algorithms make the same computation for solvable groups of order at most 100 very fast. For the wreath product of the group of upper triangular invertible matrices over the field of 7 elements and the cyclic group of order 3 (of order ) the computation of the group (of order ) takes 6 minutes, the tensor square, however, is not computable.