Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-18T01:31:17.855Z Has data issue: false hasContentIssue false

Number fields without small generators

Published online by Cambridge University Press:  29 May 2015

JEFFREY D. VAALER
Affiliation:
Department of Mathematics, University of Texas at Austin, 1 University Station C1200, Austin, Texas 78712 e-mail: vaaler@math.utexas.edu
MARTIN WIDMER
Affiliation:
Department of Mathematics, Royal Holloway, University of London, TW20 0EX Egham UK e-mail: martin.widmer@rhul.ac.uk
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Let D > 1 be an integer, and let b = b(D) > 1 be its smallest divisor. We show that there are infinitely many number fields of degree D whose primitive elements all have relatively large height in terms of b, D and the discriminant of the number field. This provides a negative answer to a question of W. Ruppert from 1998 in the case when D 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 > 3.

Information

Type
Research Article
Copyright
Copyright © Cambridge Philosophical Society 2015