The strong approximation theorem and computing with linear groups

Alla Detinko, Dane Flannery, Alexander Hulpke

Research output: Contribution to journalArticlepeer-review

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
Original languageEnglish
Pages (from-to)536-549
Number of pages14
JournalJournal of Algebra
Volume529
Early online date19 Apr 2019
DOIs
Publication statusPublished - 1 Jul 2019
Externally publishedYes

Fingerprint Dive into the research topics of 'The strong approximation theorem and computing with linear groups'. Together they form a unique fingerprint.

Cite this