Integrality and arithmeticity of solvable linear groups
Detinko, A.S.; Flannery, D.L.; de Graaf, W.A.
W.A. de Graaf
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.
|Journal Article Type||Article|
|Journal||Journal of Symbolic Computation|
|Peer Reviewed||Peer Reviewed|
|APA6 Citation||Detinko, A., Flannery, D., & de Graaf, W. (2015). Integrality and arithmeticity of solvable linear groups. Journal of Symbolic Computation, 68(Part 1), 138-145. https://doi.org/10.1016/j.jsc.2014.08.011|
|Keywords||Algebra and Number Theory; Computational Mathematics|
You might also like
Algebra, matrices, and computers
The strong approximation theorem and computing with linear groups
Practical computation with linear groups over infinite domains
Linear groups and computation
Algorithms for experimenting with Zariski dense subgroups