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

https://hal.archives-ouvertes.fr/hal-01447059
Contributor : Pierre Lezowski <>
Submitted on : Thursday, January 26, 2017 - 3:28:17 PM
Last modification on : Thursday, January 11, 2018 - 6:22:36 AM
Long-term archiving on: Friday, April 28, 2017 - 8:23:07 AM

File

quaterminima.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01447059, version 1

Citation

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

Share

Metrics

Record views

61

Files downloads

33