Computing in arithmetic groups with Voronoï's algorithm. (Q2344291): Difference between revisions

A new version of Voronoi's algorithm is applied to calculate presentations of the unit group for orders in a simple \(\mathbb Q\)-algebra. The algorithm appears to be faster than previous ones, including those which use an action on a hyperbolic space. As a striking case, a presentation of the normalized unit group of a maximal order in \(\bigl(\frac{19,37}{\mathbb Q}\bigr)\) by 56 generators and a single relation is obtained in just 5 minutes.