The strong approximation theorem and computing with linear groups

05/07/2019
by   Alla Detinko, et al.
0

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 H ≤SL(n, ℤ) for n ≥ 2. More generally, we are able to compute all congruence quotients of a finitely generated Zariski dense subgroup of SL(n, ℚ) for n > 2.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/10/2019

Integrality and arithmeticity of solvable linear groups

We develop a practical algorithm to decide whether a finitely generated ...
research
02/19/2021

Universal Approximation Theorem for Neural Networks

Is there any theoretical guarantee for the approximation ability of neur...
research
02/01/2023

A formalisation of Gallagher's ergodic theorem

Gallagher's ergodic theorem is a result in metric number theory. It stat...
research
11/27/1999

Cox's Theorem Revisited

The assumptions needed to prove Cox's Theorem are discussed and examined...
research
12/14/2020

Complexes, Graphs, Homotopy, Products and Shannon Capacity

A finite abstract simplicial complex G defines the Barycentric refinemen...
research
06/04/2019

Quasi-automatic groups are asynchronously automatic

A quasi-automatic semigroup is a finitely generated semigroup with a rat...
research
12/26/2018

Group evolution patterns in running races

We address the problem of tracking and detecting interactions between th...

Please sign up or login with your details

Forgot password? Click here to reset