The strong approximation theorem and computing with linear groups

From MaRDI portal




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 HleqmathrmSL(n,mathbbZ) for ngeq2. More generally, we are able to compute all congruence quotients of a finitely generated Zariski dense subgroup of mathrmSL(n,mathbbQ) for n>2.





Describes a project that uses

Uses Software





This page was built for publication: The strong approximation theorem and computing with linear groups

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