Computing arithmetic Kleinian groups

Aurel Page 1, 2
2 LFANT - Lithe and fast algorithmic number theory
IMB - Institut de Mathématiques de Bordeaux, Inria Bordeaux - Sud-Ouest
Abstract : Arithmetic Kleinian groups are arithmetic lattices in PSL_2(C). We present an algorithm which, given such a group Gamma, returns a fundamental domain and a finite presentation for Gamma with a computable isomorphism.
Liste complète des métadonnées

Cited literature [14 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00703043
Contributor : Aurel Page <>
Submitted on : Friday, September 20, 2013 - 2:40:47 PM
Last modification on : Thursday, January 11, 2018 - 6:22:36 AM
Document(s) archivé(s) le : Friday, April 7, 2017 - 12:38:23 AM

Files

kln_gps.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00703043, version 3
  • ARXIV : 1206.0087

Collections

Citation

Aurel Page. Computing arithmetic Kleinian groups. Mathematics of Computation, American Mathematical Society, 2015, 84 (295), pp.2361-2390. ⟨hal-00703043v3⟩

Share

Metrics

Record views

618

Files downloads

224