Computation of Euclidean minima in totally definite quaternion fields
Résumé
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.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...