Imprimitive ninth-degree number fields with small discriminants

Diaz, Francisco Diaz y; Olivier, M.

doi:10.1090/s0025-5718-1995-1260128-x

Cited by 6 publications

(10 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Diaz y Diaz and Olivier [14] have applied a relative version of the geometry of numbers methods to compute tables of imprimitive fields of degree 9. These tables do not, however, cover all the imprimitive Galois groups of that degree.…”

Section: Results Known To Datementioning

confidence: 99%

A Database for Field Extensions of the Rationals

Klüners¹,

Malle²

2001

LMS J. Comput. Math.

View full text Add to dashboard Cite

show abstract

Section: Results Known To Datementioning

confidence: 99%

A Database for Field Extensions of the Rationals

Klüners¹,

Malle²

2001

LMS J. Comput. Math.

View full text Add to dashboard Cite

show abstract

“…License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use incorporated into Martinet-type searches for nonics in [5]. In the most interesting case here, namely when the base field is quadratic (i.e.…”

Section: This Improvement Wasmentioning

confidence: 99%

“…In [13], Martinet gives a version of Hunter's theorem suitable for relative extensions which has been used to carry out similar searches for imprimitive fields [4,5,16,17,18,19]. Note, however, that for even modest degree fields and small sets of primes, such as S = {2, 3}, using a standard Hunter search to find all fields unramified outside S can become computationally burdensome.…”

mentioning

confidence: 99%

A targeted Martinet search

Driver

Jones

2008

Math. Comp.

View full text Add to dashboard Cite

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.An important problem in the study of fields is to determine all number fields of a fixed degree having a prescribed ramification structure. This paper will focus on finding all imprimitive number fields of a given degree unramified outside of a finite set of primes.Hunter's theorem has been used extensively for computing all primitive number fields of a given degree with absolute discriminant below a given bound. In [13], Martinet gives a version of Hunter's theorem suitable for relative extensions which has been used to carry out similar searches for imprimitive fields [4,5,16,17,18,19]. Note, however, that for even modest degree fields and small sets of primes, such as S = {2, 3}, using a standard Hunter search to find all fields unramified outside S can become computationally burdensome. This can be ameliorated by carrying out a targeted Hunter search where one searches for all fields with specific discriminants, but only those possible for fields unramified away from S. This approach was introduced in [6] and refined in [7] to determine all sextic and septic fields with S = {2, 3}, respectively. It has subsequently been used to investigate fields of degrees 8 and 9 ramified at a single prime in [11,12].In this paper, we combine Martinet's theorem with the targeted search technique to form what we call a targeted Martinet search. We then demonstrate the algorithm by using it to compute complete tables of imprimitive decic fields with prescribed ramification.Section 1 describes the process of conducting a number field search based on Martinet's theorem. The size of the relative extensions considered in applications here are larger than those in the literature. Section 2 describes how targeting can be used with a search described in Section 1, with details on combining congruences and archimedean bounds given in Section 3. Finally, Section 4 summarizes the results of several searches carried out using the methods in this paper.

show abstract

“…We have computed the subfields of 1112 imprimitive fields of degree 9. These fields have been taken from a table of [7]. Explicit examples are given in [10].…”

Section: The Computation Of Generating Polynomialsmentioning

confidence: 99%

On computing subfields. A detailed description of the algorithm

Klüners¹

1998

Journal De Théorie Des Nombres De Bordeaux

View full text Add to dashboard Cite

Imprimitive ninth-degree number fields with small discriminants

Cited by 6 publications

References 34 publications

A Database for Field Extensions of the Rationals

A Database for Field Extensions of the Rationals

A targeted Martinet search

On computing subfields. A detailed description of the algorithm

Contact Info

Product

Resources

About