Computing generators of arithmetic groups
The page contains Magma
programs for computing generators of arithmetic groups corresponding to diagonalisable,
unipotent and solvable algebraic groups. The algebraic groups are assumed to be connected.
The input to the algorithm is the Lie algebra of the group.
The algorithms are described in the papers
- Willem de Graaf and Andrea Pavan, Constructing arithmetic subgroups of unipotent groups, Journal of Algebra,
322 3950--3970 (2009).
- Paolo Faccin, Willem de Graaf and Wilhelm Plesken, Computing generators of the unit group of an
integral abelian group ring, Journal of Algebra, 373, 441--452 (2013).
The file is:
At the top of the filee the provided functions are explained,
and illustrated by an example.