Integrality and arithmeticity of solvable linear groups
Group Theory
2019-05-13 v1 Symbolic Computation
Abstract
We develop a practical algorithm to decide whether a finitely generated subgroup of a solvable algebraic group is arithmetic. This incorporates a procedure to compute a generating set of an arithmetic subgroup of . 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 {\sc Magma}.
Cite
@article{arxiv.1905.04287,
title = {Integrality and arithmeticity of solvable linear groups},
author = {W. A. de Graaf and A. S. Detinko and D. L. Flannery},
journal= {arXiv preprint arXiv:1905.04287},
year = {2019}
}