### Abstract

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 language | English (US) |
---|---|

Pages (from-to) | 1109-1117 |

Number of pages | 9 |

Journal | Mathematics of Computation |

Volume | 78 |

Issue number | 266 |

DOIs | |

State | Published - Mar 31 2009 |

### ASJC Scopus subject areas

- Algebra and Number Theory
- Computational Mathematics
- Applied Mathematics

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

## Cite this

Driver, E. D., & Jones, J. (2009). A targeted martinet search.

*Mathematics of Computation*,*78*(266), 1109-1117. https://doi.org/10.1090/S0025-5718-08-02178-9