Êtes-vous un étudiant de l'EPFL à la recherche d'un projet de semestre?
Travaillez avec nous sur des projets en science des données et en visualisation, et déployez votre projet sous forme d'application sur Graph Search.
We establish an explicit upper bound for the Euclidean minimum of a number field which depends, in a precise manner, only on its discriminant and the number of real and complex embeddings. Such bounds were shown to exist by Davenport and Swinnerton-Dyer ([9-11]). In the case of totally real fields, an optimal bound was conjectured by Minkowski and it is proved for fields of small degree. In this note we develop methods of McMullen ([20]) in the case of mixed signature in order to get explicit bounds for the Euclidean minimum. (C) 2016 Elsevier Inc. All rights reserved.
Maryna Viazovska, Nihar Prakash Gargava, Vlad Serban