Computation of Euclidean minima in totally definite quaternion fields - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year : 2017

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 (310.61 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

  • HAL Id : hal-01447059 , version 2

Cite

Jean-Paul Cerri, Pierre Lezowski. Computation of Euclidean minima in totally definite quaternion fields. 2017. ⟨hal-01447059v2⟩
443 View
240 Download

Share

Gmail Facebook X LinkedIn More