Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
401757 | Journal of Symbolic Computation | 2015 | 8 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
A.S. Detinko, D.L. Flannery, W.A. de Graaf,