Computing in arithmetic groups with Voronoï's algorithm. (Q2344291): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: polymake / rank | |||
Normal rank | |||
Revision as of 13:41, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing in arithmetic groups with Voronoï's algorithm. |
scientific article |
Statements
Computing in arithmetic groups with Voronoï's algorithm. (English)
0 references
13 May 2015
0 references
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.
0 references
unit groups of orders
0 references
maximal orders
0 references
generators
0 references
presentations
0 references
word problem
0 references
lattices
0 references
Voronoï algorithm
0 references
