Skip to Main content Skip to Navigation
Journal articles

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.
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
Contributor : Aurel Page Connect in order to contact the contributor
Submitted on : Friday, September 20, 2013 - 2:40:47 PM
Last modification on : Saturday, December 4, 2021 - 3:42:44 AM
Long-term archiving on: : Friday, April 7, 2017 - 12:38:23 AM


Files produced by the author(s)


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



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



Les métriques sont temporairement indisponibles