Abstract

The Euclidean minimum M(K)M(K) of a number field KK is an important numerical invariant that indicates whether KK is norm-Euclidean. When KK is a non-CM field of unit rank 2 or higher, Cerri showed M(K)M(K), as the supremum in the Euclidean spectrum Spec(K)Spec(K), 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 KK of unit rank 3 or higher, M(K)M(K) is isolated and attained and Cerri's algorithm computes M(K)M(K) in finite time. (2) If KK is a non-CM field of unit rank 2 or higher, then the computational complexity of M(K)M(K) is bounded in terms of the degree, discriminant and regulator of KK.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.