Article ID Journal Published Year Pages File Type
401933 Journal of Symbolic Computation 2008 19 Pages PDF
Abstract

We develop methods for computing with matrix groups defined over a range of infinite domains, and apply those methods to the design of algorithms for nilpotent groups. In particular, we provide a practical nilpotency testing algorithm for matrix groups over an infinite field. We also provide algorithms to answer a number of structural questions for a nilpotent matrix group.The main algorithms have been implemented in GAP, for groups over the rational number field.

Related Topics
Physical Sciences and Engineering Computer Science Artificial Intelligence