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.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01447059
Contributor : Pierre Lezowski <>
Submitted on : Tuesday, March 7, 2017 - 1:14:16 PM
Last modification on : Tuesday, July 17, 2018 - 1:18:00 AM
Long-term archiving on : Thursday, June 8, 2017 - 1:30:18 PM

File

quaterminima.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01447059, version 2

Collections

Citation

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

Share

Metrics

Record views

521

Files downloads

84