Abstract
The Euclidean minimum of a number field is an important numerical invariant that indicates whether is norm-Euclidean. When is a non-CM field of unit rank 2 or higher, Cerri showed , as the supremum in the Euclidean spectrum , is isolated and attained and can be computed in finite time. We extend Cerri's works by applying recent dynamical results of Lindenstrauss and Wang. In particular, the following facts are proved: (1) For any number field of unit rank 3 or higher, is isolated and attained and Cerri's algorithm computes in finite time. (2) If is a non-CM field of unit rank 2 or higher, then the computational complexity of is bounded in terms of the degree, discriminant and regulator of .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.