Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS
   
Mobile Device Pairing
Green Open Access
Mathematics of Computation
Mathematics of Computation
ISSN 1088-6842(online) ISSN 0025-5718(print)

 

A targeted Martinet search


Authors: Eric D. Driver and John W. Jones
Journal: Math. Comp. 78 (2009), 1109-1117
MSC (2000): Primary 11Y40; Secondary 11-04
Published electronically: August 22, 2008
MathSciNet review: 2476573
Full-text PDF

Abstract | References | Similar Articles | Additional Information

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.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Mathematics of Computation with MSC (2000): 11Y40, 11-04

Retrieve articles in all journals with MSC (2000): 11Y40, 11-04


Additional Information

Eric D. Driver
Affiliation: Department of Mathematics, Arizona State University, Tempe, Arizona 85287-1804
Address at time of publication: Lockheed Martin Corporation, P.O. Box 85, Litchfield Park, Arizona 85340

John W. Jones
Affiliation: Department of Mathematics, Arizona State University, Tempe, Arizona 85287-1804

DOI: http://dx.doi.org/10.1090/S0025-5718-08-02178-9
PII: S 0025-5718(08)02178-9
Received by editor(s): August 20, 2007
Received by editor(s) in revised form: May 13, 2008
Published electronically: August 22, 2008
Article copyright: © Copyright 2008 American Mathematical Society
The copyright for this article reverts to public domain 28 years after publication.