Algorithms for linear groups of finite ranks

Alla Detinko, Dane Flannery, Eamonn O'Brien

Research output: Contribution to journalArticlepeer-review

6 Citations (Scopus)


Let G be a finitely generated solvable-by-finite linear group. We present an algorithm to compute the torsion-free rank of G and a bound on the Prüfer rank of G. This yields in turn an algorithm to decide whether a finitely generated subgroup of G has finite index. The algorithms are implemented in Magma for groups over algebraic number fields.
Original languageEnglish
Pages (from-to)187–196
Number of pages10
JournalJournal of Algebra
Issue number1
Early online date16 Jul 2013
Publication statusPublished - 1 Nov 2013
Externally publishedYes


Dive into the research topics of 'Algorithms for linear groups of finite ranks'. Together they form a unique fingerprint.

Cite this