1999
DOI: 10.1515/crll.1999.511.95
|View full text |Cite
|
Sign up to set email alerts
|

2-generator arithmetic Kleinian groups

Abstract: We show that among the infinitely many conjugacy classes of finite covolume Kleinian groups generated by two elements of finite order, there are only finitely many which are arithmetic. In particular there are only finitely many arithmetic generalized triangle groups. This latter result generalizes a theorem of Takeuchi.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
18
0
1

Year Published

2001
2001
2024
2024

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 14 publications
(19 citation statements)
references
References 22 publications
0
18
0
1
Order By: Relevance
“…The cases where γ is real have been investigated in [30,31,35] We have shown in [33], that for each pair (p, q) there are only finitely many γ in C which yield arithmetic Kleinian groups and for all but a finite number of pairs (p, q), that finite number is zero. It is our aim here to determine all γ such that Γ is an arithmetic Kleinian group (i.e.…”
Section: Parametersmentioning
confidence: 99%
See 2 more Smart Citations
“…The cases where γ is real have been investigated in [30,31,35] We have shown in [33], that for each pair (p, q) there are only finitely many γ in C which yield arithmetic Kleinian groups and for all but a finite number of pairs (p, q), that finite number is zero. It is our aim here to determine all γ such that Γ is an arithmetic Kleinian group (i.e.…”
Section: Parametersmentioning
confidence: 99%
“…To eliminate these groups we now seek conditions on γ which force a discrete group Γ = f, g to be a free product. Moreover, we will extend the methods of [33] to enumerate the parameters γ which give rise to arithmetic Kleinian groups by obtaining bounds which involve the discriminant of the power basis of Q(γ) over L determined by γ. For this purpose, and also for other methods to be used in the enumeration, we want to obtain as stringent bounds as possible on |γ|, (γ), (γ).…”
Section: Free Productsmentioning
confidence: 99%
See 1 more Smart Citation
“…Following [22] we define a Kleinian group G to be nearly arithmetic if G is a Kleinian subgroup of an arithmetic Kleinian group and G does not split as a nontrivial free product. Of course, an arithmetic Kleinian group is nearly arithmetic.…”
Section: Then G Is a Subgroup Of An Arithmetic Kleinian Groupmentioning
confidence: 99%
“…In previous work [22], [10] we established the finiteness of the number of two-generator arithmetic Kleinian groups generated by a pair of elliptic or parabolic elements. Further, we found there are exactly 4 arithmetic Kleinian groups generated by two parabolic elements [10], which are all knot and link complements.…”
Section: Introductionmentioning
confidence: 99%