2014
DOI: 10.1090/s0025-5718-2014-02865-2
|View full text |Cite
|
Sign up to set email alerts
|

From the Poincaré Theorem to generators of the unit group of integral group rings of finite groups

Abstract: We give an algorithm to determine finitely many generators for a subgroup of finite index in the unit group of an integral group ring ZG of a finite nilpotent group G, this provided the rational group algebra QG does not have simple components that are division classical quaternion algebras or two-by-two matrices over a classical quaternion algebra with centre Q. The main difficulty is to deal with orders in quaternion algebras over the rationals or a quadratic imaginary extension of the rationals. In order to… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
21
0

Year Published

2015
2015
2020
2020

Publication Types

Select...
6

Relationship

2
4

Authors

Journals

citations
Cited by 6 publications
(21 citation statements)
references
References 48 publications
0
21
0
Order By: Relevance
“…However both algorithms work perfectly fine for discrete subgroups of PSL + (Γ n (R)), hence for Z-orders in PSL + (Γ n (R)). To keep the symmetry with the earlier work [19] and also with classical work on Fuchsian and Kleinian groups, we decided to state it this way. However in Section 6, we will need an algorithm for discrete subgroups of PSL + (Γ n (R)), which are not contained in PSL + (Γ n (Z)).…”
Section: The Algorithmmentioning
confidence: 99%
See 3 more Smart Citations
“…However both algorithms work perfectly fine for discrete subgroups of PSL + (Γ n (R)), hence for Z-orders in PSL + (Γ n (R)). To keep the symmetry with the earlier work [19] and also with classical work on Fuchsian and Kleinian groups, we decided to state it this way. However in Section 6, we will need an algorithm for discrete subgroups of PSL + (Γ n (R)), which are not contained in PSL + (Γ n (Z)).…”
Section: The Algorithmmentioning
confidence: 99%
“…The goal of this paper is to develop a new method that deals with these components. This work is in fact a continuation of the work done in [19]. As explained above, in that paper, the authors use the action on hyperbolic space of dimension 2 and 3 and develop an algorithm, which takes as an input a discrete cofinite subgroup of PSL 2 (R) or PSL 2 (C) to return a finite-sided convex polyhedron that contains a Dirichlet fundamental domain of the discrete subgroup.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations
“…This has been done in only some exceptional cases (see [10,12,18]). An apparently easier problem is to study the units of finite order.…”
Section: Juriaans Et Almentioning
confidence: 99%