Algorithms for Experimenting with Zariski Dense Subgroups

Alla Detinko, Dane Flannery, Alexander Hulpke

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)

Abstract

We give a method to describe all congruence images of a finitely generated Zariski dense group H≤SL(n,Z). The method is applied to obtain efficient algorithms for solving this problem in odd prime degree n; if n = 2 then we compute all congruence images only modulo primes. We propose a separate method that works for all n as long as H contains a known transvection. The algorithms have been implemented in GAP, enabling computer experiments with important classes of linear groups that have recently emerged.
Original languageEnglish
Pages (from-to)296-305
Number of pages10
JournalExperimental Mathematics
Volume29
Issue number3
Early online date4 Jun 2018
DOIs
Publication statusPublished - 1 Sep 2020
Externally publishedYes

Fingerprint Dive into the research topics of 'Algorithms for Experimenting with Zariski Dense Subgroups'. Together they form a unique fingerprint.

Cite this