The strong approximation theorem and computing with linear groups
Detinko, A.; Flannery, D.; Hulpke, A.
We obtain a computational realization of the strong approximation theorem. That is, we develop algorithms to compute all congruence quotients modulo rational primes of a finitely generated Zariski dense group for . More generally, we are able to compute all congruence quotients of a finitely generated Zariski dense subgroup of SL(n,Q) for n > 2.
|Journal Article Type||Article|
|Publication Date||Jul 1, 2019|
|Journal||Journal of Algebra|
|Peer Reviewed||Peer Reviewed|
|APA6 Citation||Detinko, A., Flannery, D., & Hulpke, A. (2019). The strong approximation theorem and computing with linear groups. Journal of Algebra, 529, 536-549. https://doi.org/10.1016/j.jalgebra.2019.04.011|
|Keywords||Algebra and Number Theory|
This file is under embargo until Apr 20, 2021 due to copyright reasons.
Contact A.Detinko@hull.ac.uk to request a copy for personal use.
You might also like
Algebra, matrices, and computers
Practical computation with linear groups over infinite domains
Linear groups and computation
Algorithms for experimenting with Zariski dense subgroups
Zariski density and computing in arithmetic groups