Algorithms for experimenting with Zariski dense subgroups

DOI10.1080/10586458.2018.1466217MaRDI QIDQ6293584arXivFDO

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

Publication date 6 November 2017

Published in arXiv

Full work available at URL https://doi.org/10.1080/10586458.2018.1466217

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to group theory (20-04) Computational methods for problems pertaining to group theory (20-08) Linear algebraic groups over arbitrary fields (20G15) Other matrix groups over rings (20H25) Symbolic computation and algebraic computation (68W30)

arXiv classification

math.GR

Abstract: We give a method to describe all congruence images of a finitely generated Zariski dense group $HleqmathrmSL(n,mathbbZ)$. 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.

This page was built for publication: Algorithms for experimenting with Zariski dense subgroups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6293584)