The strong approximation theorem and computing with linear groups

Paper Info

Title
The strong approximation theorem and computing with linear groups

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 H≤SL(n,Z) for n≥2. More generally, we are able to compute all congruence quotients of a finitely generated Zariski dense subgroup of SL(n,Q) for n>2.

Authors (3 rows)

Cited by (0 rows)

References (0 rows)

Name	Order	Citations	PageRank
A. S. Detinko	1	11	3.36
Dane L. Flannery	2	0	2.70
Alexander Hulpke	3	64	9.89