Integrality and arithmeticity of solvable linear groups

A. S. Detinko, D. L. Flannery, W. A. de Graaf

Research output: Contribution to journalArticlepeer-review

5 Citations (Scopus)


We develop a practical algorithm to decide whether a finitely generated subgroup of a solvable algebraic group G is arithmetic. This incorporates a procedure to compute a generating set of an arithmetic subgroup of G. We also provide a simple new algorithm for integrality testing of finitely generated solvable-by-finite linear groups over the rational field. The algorithms have been implemented in Magma.
Original languageEnglish
Pages (from-to)138–145
Number of pages8
JournalJournal of Symbolic Computation
Issue numberPart 1
Early online date11 Aug 2014
Publication statusPublished - 1 May 2015
Externally publishedYes


Dive into the research topics of 'Integrality and arithmeticity of solvable linear groups'. Together they form a unique fingerprint.

Cite this