Abstract
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 language | English |
|---|---|
| Pages (from-to) | 967-986 |
| Journal | Mathematics of Computation |
| Volume | 87 |
| Issue number | 310 |
| Early online date | 7 Aug 2017 |
| DOIs | |
| Publication status | Published - Mar 2018 |
Fingerprint
Dive into the research topics of 'Zariski density and computing in arithmetic groups'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver