Computing in arithmetic groups with Voronoï's algorithm.
From MaRDI portal
Abstract: We describe an algorithm, meant to be very general, to compute a presentation of the group of units of an order in a (semi)simple algebra over Q. Our method is based on a generalisation of Vorono"i's algorithm for computing perfect forms, combined with Bass-Serre theory. It differs essentially from previously known methods to deal with such questions, e.g. for units in quaternion algebras. We illustrate this new algorithm by a series of examples where the computations are carried out completely.
Recommendations
Cites work
- scientific article; zbMATH DE number 3472350 (Why is no real title available?)
- scientific article; zbMATH DE number 3477356 (Why is no real title available?)
- scientific article; zbMATH DE number 1859030 (Why is no real title available?)
- Algorithms for finite soluble groups and applications
- Applications of a Computer Implementation of Poincare's Theorem on Fundamental Polyhedra
- Computational geometry of positive definite quadratic forms. Polyhedral reduction theories, algorithms, and applications
- Computing isometries of lattices
- Covering theory for graphs of groups
- Dual Cones and the Voronoi Algorithm
- Enumerating perfect forms
- Generators and relations for certain special linear groups
- Groups of homeomorphisms of a simply connected space
- Hyperbolic tessellations associated to Bianchi groups
- Modular forms, a computational approach. With an appendix by Paul E. Gunnells
- On zeta functions of quaternion algebras
- Presentations for groups acting on simply-connected complexes
- Presentations of the unit group of an order in a non-split quaternion algebra.
- Recognition of division algebras.
- Small-dimensional classifying spaces for arithmetic subgroups of general linear groups
- The Magma algebra system. I: The user language
- The cohomology of \(SL_3(Z)\)
- Units in skew fields
- Units of classical orders: A survey
- Voronoï's reduction theory of \(\mathrm{GL}_n\) over a totally real number field
- polymake: a framework for analyzing convex polytopes
Cited in
(16)- scientific article; zbMATH DE number 3918492 (Why is no real title available?)
- Resolutions for unit groups of orders
- The Farrell-Tate and Bredon homology for \(\operatorname{PSL}_4(\mathbb{Z})\) via cell subdivisions
- On Farrell-Tate cohomology of \(\operatorname{GL}_3\) over rings of quadratic integers
- Computing isomorphisms between lattices
- Equivalence of lattice orbit polytopes
- On units in orders in 2-by-2 matrices over quaternion algebras with rational center
- Computing S-unit groups of orders
- Computing the unit group of a commutative finite \(\mathbb{Z}\)-algebra
- Maximal finite subgroups and minimal classes.
- Presentations of groups acting discontinuously on direct products of hyperbolic spaces
- Linear groups and computation
- The generalized Voronoi-algorithm in totally real algebraic number fields
- Dual Cones and the Voronoi Algorithm
- The constructive membership problem for discrete two-generator subgroups of \(\operatorname{SL}_2(\mathbb{R})\)
- The mod 2 cohomology rings of congruence subgroups in the Bianchi groups
This page was built for publication: Computing in arithmetic groups with Voronoï's algorithm.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2344291)
