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]
< Leer menos
Institut de Mathématiques de Bordeaux [IMB]
Lithe and fast algorithmic number theory [LFANT]
Idioma
en
Article de revue
Este ítem está publicado en
Mathematics of Computation. 2015, vol. 84, n° 295, p. 2361-2390
American Mathematical Society
Resumen en inglés
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.< Leer menos
Palabras clave en inglés
hyperbolic geometry
fundamental domain
arithmetic group
computational number theory
quaternion algebra
Proyecto europeo
Algorithmic Number Theory in Computer Science
Orígen
Importado de HalCentros de investigación