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]
< Leer menos
Institut de Mathématiques de Bordeaux [IMB]
Lithe and fast algorithmic number theory [LFANT]
Idioma
en
Document de travail - Pré-publication
Resumen en inglés
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.< Leer menos
Palabras clave
géométrie hyperbolique
groupe arithmétique
domaine fondamental
algèbre de quaternions
théorie algorithmique des nombres
Orígen
Importado de HalCentros de investigación