2015
DOI: 10.1090/s0025-5718-2015-02939-1
|View full text |Cite
|
Sign up to set email alerts
|

Computing arithmetic Kleinian groups

Abstract: Arithmetic Kleinian groups are arithmetic lattices in PSL 2 (C). We present an algorithm that, given such a group Γ, returns a fundamental domain and a finite presentation for Γ with a computable isomorphism. 2

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
31
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
7
2

Relationship

1
8

Authors

Journals

citations
Cited by 25 publications
(32 citation statements)
references
References 23 publications
1
31
0
Order By: Relevance
“…In this subsection we will see a shortcut to a method of computing Dirichlet domains introduced by Page [21], for Macfarlane manifolds. We focus on Page's algorithm because earlier ones have been specific to the non-compact arithmetic case [13,4,26,25], or have required either arithmeticity [8,29,21] or compactness [9,18] whereas, as we showed in §4, Macfarlane manifolds include examples from every combination of arithmetic and non-arithmetic with compact and non-compact.…”
Section: Quaternion Dirichlet Domainsmentioning
confidence: 99%
See 1 more Smart Citation
“…In this subsection we will see a shortcut to a method of computing Dirichlet domains introduced by Page [21], for Macfarlane manifolds. We focus on Page's algorithm because earlier ones have been specific to the non-compact arithmetic case [13,4,26,25], or have required either arithmeticity [8,29,21] or compactness [9,18] whereas, as we showed in §4, Macfarlane manifolds include examples from every combination of arithmetic and non-arithmetic with compact and non-compact.…”
Section: Quaternion Dirichlet Domainsmentioning
confidence: 99%
“…Thus, in our setup, Page's algorithm translates to searching for points in the orbit Orb Γ p1q " tγγ : | γ P Γu in order of increasing trace, and computing the perpendicular bisector of each one until all sides of the Dirichlet domain D Γ p1q have been found. Details and efficiency analysis of this can be found in [21].…”
Section: Quaternion Dirichlet Domainsmentioning
confidence: 99%
“…In order to find many such G-coverings of every manifold Y = H 3 /Γ obtained in Section 5.1, we first compute a finite presentation of Γ, using the algorithms of [24]. Since Γ ∼ = π 1 (Y ), G-coverings of Y correspond to surjective homomorphisms Γ → G. Using the presentation of Γ, we enumerate surjective homomorphisms Γ → G up to conjugacy, using the methods described in [17, §9.1].…”
Section: 2mentioning
confidence: 99%
“…There is further interest in homology with twisted coefficients, congruence subgroups and modular forms (see, for instance, [28,30]). Currently, Page [16] is working on optimizing algorithms in order to obtain more cell complexes for Bianchi groups and other Kleinian groups.…”
Section: The Algorithm Computing the Bianchi Fundamental Polyhedronmentioning
confidence: 99%