Testing polycyclicity of finitely generated rational matrix groups

Bjõrn Uwe Michael Assmann, Bettina Eick

Research output: Contribution to journalArticlepeer-review

6 Citations (Scopus)

Abstract

We describe algorithms for testing polycyclicity and nilpotency for finitely generated subgroups of GL( d, Q) and thus we show that these properties are decidable. Variations of our algorithm can be used for testing virtual polycyclicity and virtual nilpotency for finitely generated subgroups of GL(d, Q).

Original languageEnglish
Pages (from-to)1669-1682
Number of pages14
JournalMathematics of Computation
Volume76
Issue number259
Publication statusPublished - 2007

Fingerprint

Dive into the research topics of 'Testing polycyclicity of finitely generated rational matrix groups'. Together they form a unique fingerprint.

Cite this