Computation of Euclidean minima in totally definite quaternion fields
CERRI, Jean-Paul
Lithe and fast algorithmic number theory [LFANT]
Institut de Mathématiques de Bordeaux [IMB]
Lithe and fast algorithmic number theory [LFANT]
Institut de Mathématiques de Bordeaux [IMB]
CERRI, Jean-Paul
Lithe and fast algorithmic number theory [LFANT]
Institut de Mathématiques de Bordeaux [IMB]
< Réduire
Lithe and fast algorithmic number theory [LFANT]
Institut de Mathématiques de Bordeaux [IMB]
Langue
en
Article de revue
Ce document a été publié dans
International Journal of Number Theory. 2019, vol. 15, n° 1, p. 43–66
World Scientific Publishing
Résumé en anglais
We describe an algorithm that allows to compute the Euclidean minimum (for the norm form) of any order of a totally definite quaternion field over a number field K of degree strictly greater than 1. Our approach is a ...Lire la suite >
We describe an algorithm that allows to compute the Euclidean minimum (for the norm form) of any order of a totally definite quaternion field over a number field K of degree strictly greater than 1. Our approach is a generalization of previous work dealing with number fields. The algorithm was practically implemented when K has degree 2.< Réduire
Mots clés en anglais
Quaternion algebras
Norm-Euclidean minimum
Algorithmic number theory
Norm-Euclidean orders
Origine
Importé de halUnités de recherche