The strong approximation theorem and computing with linear groups

From MaRDI portal
Publication:2415313

DOI10.1016/J.JALGEBRA.2019.04.011zbMATH Open1467.20036arXiv1905.02683OpenAlexW2937748244MaRDI QIDQ2415313FDOQ2415313


Authors: A. Hulpke, A. S. Detinko, D. L. Flannery Edit this on Wikidata


Publication date: 21 May 2019

Published in: Journal of Algebra (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1905.02683




Recommendations




Cites Work


Cited In (5)

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)