Skip to main content

The strong approximation theorem and computing with linear groups

Detinko, A.; Flannery, D.; Hulpke, A.

Authors

A. Detinko

D. Flannery

A. Hulpke



Abstract

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
Print ISSN 0021-8693
Publisher Elsevier
Peer Reviewed Peer Reviewed
Volume 529
Pages 536-549
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
DOI https://doi.org/10.1016/j.jalgebra.2019.04.011
Keywords Algebra and Number Theory
Publisher URL https://www.sciencedirect.com/science/article/pii/S0021869319302005?via%3Dihub#!

Files

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



Downloadable Citations

;