The system will be going down for regular maintenance. Please save your work and logout.
Computation of the Euclidean minimum of algebraic number fields
LEZOWSKI, Pierre
Institut de Mathématiques de Bordeaux [IMB]
Lithe and fast algorithmic number theory [LFANT]
Institut de Mathématiques de Bordeaux [IMB]
Lithe and fast algorithmic number theory [LFANT]
LEZOWSKI, Pierre
Institut de Mathématiques de Bordeaux [IMB]
Lithe and fast algorithmic number theory [LFANT]
< Reduce
Institut de Mathématiques de Bordeaux [IMB]
Lithe and fast algorithmic number theory [LFANT]
Language
en
Article de revue
This item was published in
Mathematics of Computation. 2014, vol. 83, p. 1397-1426
American Mathematical Society
English Abstract
We present an algorithm to compute the Euclidean minimum of an algebraic number field, which is a generalization of the algorithm restricted to the totally real case described by Cerri. With a practical implementation, we ...Read more >
We present an algorithm to compute the Euclidean minimum of an algebraic number field, which is a generalization of the algorithm restricted to the totally real case described by Cerri. With a practical implementation, we obtain unknown values of the Euclidean minima of algebraic number fields of degree up to 8 in any signature, especially for cyclotomic fields, and many new examples of norm-Euclidean or non-norm-Euclidean algebraic number fields. We also prove a result of independant interest concerning real quadratic fields whose Euclidean minimum is equal to 1.Read less <
European Project
Algorithmic Number Theory in Computer Science
Origin
Hal imported