Computing fundamental domains for 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 : We present an algorithm which, given an arithmetic Kleinian group Γ, returns a fundamental domain and a finite presentation for Γ with a computable isomorphism.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [26 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00658841
Contributor : Aurel Page <>
Submitted on : Wednesday, January 11, 2012 - 2:12:36 PM
Last modification on : Monday, May 6, 2019 - 5:34:02 PM
Long-term archiving on: Thursday, April 12, 2012 - 2:35:31 AM

File

memoire.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00658841, version 1

Collections

Citation

Aurel Page. Computing fundamental domains for arithmetic Kleinian groups. 2010. ⟨hal-00658841⟩

Share

Metrics

Record views

299

Files downloads

244