Number fields without small generators

preprint2014arXivOpen access

Abstract

Let D>1D>1 be an integer, and let b=b(D)>1b=b(D)>1 be its smallest divisor. We show that there are infinitely many number fields of degree DD whose primitive elements all have relatively large height in terms of bb, DD and the discriminant of the number field. This provides a negative answer to a questions of W. Ruppert from 1998 in the case when DD is composite. Conditional on a very weak form of a folk conjecture about the distribution of number fields, we negatively answer Ruppert's question for all D>3D>3.

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.