Zariski density and computing in arithmetic groups

A. Detinko, D. L. Flannery, A. Hulpke

Research output: Contribution to journalArticlepeer-review

12 Citations (Scopus)


For n > 2, let Γn denote either SL(n, Z) or Sp(n, Z). We give a practical algorithm to compute the level of the maximal principal congruence subgroup in an arithmetic group H ≤ Γn. This forms the main component of our methods for computing with such arithmetic groups H. More generally, we provide algorithms for computing with Zariski dense groups in Γn. We use our GAP implementation of the algorithms to solve problems that have emerged recently for important classes of linear groups.
Original languageEnglish
Pages (from-to)967-986
JournalMathematics of Computation
Issue number310
Early online date7 Aug 2017
Publication statusPublished - Mar 2018


Dive into the research topics of 'Zariski density and computing in arithmetic groups'. Together they form a unique fingerprint.

Cite this