Computation of Euclidean minima in totally definite quaternion fields - Archive ouverte HAL
Journal Articles International Journal of Number Theory Year : 2019

Computation of Euclidean minima in totally definite quaternion fields

Abstract

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.
Fichier principal
Vignette du fichier
quaterminima.pdf (319.02 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01447059 , version 1 (26-01-2017)
hal-01447059 , version 2 (07-03-2017)
hal-01447059 , version 3 (14-07-2018)

Identifiers

Cite

Jean-Paul Cerri, Pierre Lezowski. Computation of Euclidean minima in totally definite quaternion fields. International Journal of Number Theory, 2019, 15 (1), pp.43-66. ⟨10.1142/S1793042118501725⟩. ⟨hal-01447059v3⟩
458 View
267 Download

Altmetric

Share

More