A targeted martinet search

Eric D. Driver, John Jones

Research output: Contribution to journalArticlepeer-review

4 Scopus citations


Constructing number fields with prescribed ramification is an important problem in computational number theory. In this paper, we consider the problem of computing all imprimitive number fields of a given degree which are unramified outside of a given finite set of primes S by combining the techniques of targeted Hunter searches with Martinet's relative version of Hunter's theorem. We then carry out this algorithm to generate complete tables of imprimitive number fields for degrees 4 through 10 and certain sets S of small primes.

Original languageEnglish (US)
Pages (from-to)1109-1117
Number of pages9
JournalMathematics of Computation
Issue number266
StatePublished - 2009

ASJC Scopus subject areas

  • Algebra and Number Theory
  • Computational Mathematics
  • Applied Mathematics


Dive into the research topics of 'A targeted martinet search'. Together they form a unique fingerprint.

Cite this