Algorithms for computing with nilpotent matrix groups over infinite domains

A. S. Detinko, D. L. Flannery

Research output: Contribution to journalArticlepeer-review

8 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)8-26
Number of pages19
JournalJournal of Symbolic Computation
Issue number1
Early online date17 Aug 2007
Publication statusPublished - 1 Jan 2008
Externally publishedYes


Dive into the research topics of 'Algorithms for computing with nilpotent matrix groups over infinite domains'. Together they form a unique fingerprint.

Cite this