Matrix representations for torsion-free nilpotent groups by Deep Thought

We present an algorithm for calculating a representation by unitriangular matrices over the integers of a finitely-generated torsion-free nilpotent group given by a polycyclic presentation. The algorithm uses polynomials computed by the Deep Thought algorithm which describe the multiplication in the given group. The algorithm is more efficient than a previous method.