Computing 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]
< Réduire
Institut de Mathématiques de Bordeaux [IMB]
Lithe and fast algorithmic number theory [LFANT]
Langue
en
Article de revue
Ce document a été publié dans
Mathematics of Computation. 2015, vol. 84, n° 295, p. 2361-2390
American Mathematical Society
Résumé en anglais
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.
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.< Réduire
Mots clés en anglais
hyperbolic geometry
fundamental domain
arithmetic group
computational number theory
quaternion algebra
Projet Européen
Algorithmic Number Theory in Computer Science
Origine
Importé de halUnités de recherche