Constructing arithmetic subgroups of unipotent groups. (Q2267448)

For a complex algebraic group \(G\) defined over the field of the rational numbers, Borel and Harish-Chandra proved that arithmetic subgroups are finitely generated. This result was a consequence of the Siegel theorem, which was published by Siegel 21 years before. Despite of this result, no feasible way of calculating these generators was known. In 1980, \textit{F. J. Grunewald} and \textit{D. Segal} [Ann. Math. (2) 112, 531-583 (1980; Zbl 0457.20047)] provided a general, but unsuited for practical computation, algorithm to compute a finite set of generators of an arithmetic subgroup of a unipotent group. In this paper the authors describe a practical algorithm for computing a finite set of generators of \(G(Z)\), if \(G\) is unipotent.