Computing fundamental domains for arithmetic Kleinian groups
PAGE, Aurel
Institut de Mathématiques de Bordeaux [IMB]
Lithe and fast algorithmic number theory [LFANT]
Institut de Mathématiques de Bordeaux [IMB]
Lithe and fast algorithmic number theory [LFANT]
PAGE, Aurel
Institut de Mathématiques de Bordeaux [IMB]
Lithe and fast algorithmic number theory [LFANT]
< Reduce
Institut de Mathématiques de Bordeaux [IMB]
Lithe and fast algorithmic number theory [LFANT]
Language
en
Document de travail - Pré-publication
English Abstract
We present an algorithm which, given an arithmetic Kleinian group Γ, returns a fundamental domain and a finite presentation for Γ with a computable isomorphism.
We present an algorithm which, given an arithmetic Kleinian group Γ, returns a fundamental domain and a finite presentation for Γ with a computable isomorphism.Read less <
Keywords
géométrie hyperbolique
groupe arithmétique
domaine fondamental
algèbre de quaternions
théorie algorithmique des nombres
Origin
Hal imported