DIMACS TR: 97-38

A Practical Algorithm for Finding Matrix Representations for Polycyclic Groups

Authors: Eddie H. Lo and Gretchen Ostheimer


We describe a new algorithm for finding matrix representations for polycyclic groups given by finite presentations. In contrast to previous algorithms, our algorithm is efficient enough to construct representations for some interesting examples. The examples which we studied included a collection of free nilpotent groups, and our results here led us to a theoretical result concerning such groups.

Paper Available at: ftp://dimacs.rutgers.edu/pub/dimacs/TechnicalReports/TechReports/1997/97-38.ps.gz
DIMACS Home Page