paper

Algorithms for experimenting with Zariski dense matrix groups over number fields

arXiv:2605.23798

Abstract

Let be an algebraic number field. We provide a computational analog of the strong approximation theorem for finitely generated Zariski dense groups , prime. That is, we present algorithms to find the set of congruence quotients of modulo all maximal ideals of a finitely generated subring of such that . The algorithms have been implemented in GAP. Potential applications are illustrated by a range of experiments in degree , with a special focus on Bianchi groups.