Constructing complete tables of quartic fields using Kummer theory (Q4794652)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1871626
Language Label Description Also known as
default for all languages
No label defined
    English
    Constructing complete tables of quartic fields using Kummer theory
    scientific article; zbMATH DE number 1871626

      Statements

      Constructing complete tables of quartic fields using Kummer theory (English)
      0 references
      0 references
      0 references
      0 references
      19 February 2003
      0 references
      computer solution of Diophantine equations
      0 references
      quartic extensions
      0 references
      class numbers, class groups, discriminants
      0 references
      The computation of tables of number fields was mainly done by the classical method based on the geometry of numbers, precisely using Hunter's theorem and techniques due to Martinet. But this classical method is in general inefficient. The construction of tables of quadratic fields is done quickly by generating tables of squarefree integers. Tables of cubic fields can be constructed by the efficient method of \textit{K. Belabas} [Math. Comput. 66, 1213--1237 (1997; Zbl 0882.11070)] based on results of \textit{H. Davenport} and \textit{H. Heilbronn} [Bull. Lond. Math. Soc. 1, 345--348 (1969; Zbl 0211.38602) Proc. R. Soc. Lond. 322, 405--420 (1971; Zbl 0212.08101)]. Cases of number fields of degree \(4\) or higher are more complicated. In this paper, the authors describe techniques for computing quartic fields of discriminant up to \(X\) using Kummer theory. First, in the case of imprimitive quartic fields \(L\) (containing at least one quadratic subfield), tables of quartic fields can be obtained by methods based on class field theory or Kummer theory to construct relative quadratic extensions. But the authors prefer to use Kummer's method because computations using class field theory are still quite costly. They recall techniques of constructing tables of quartic fields via relative quadratic extensions. In the case of imprimitive quartic fields, the Galois group of the extension \(L/{\mathbb{Q}}\) is isomorphic to the cyclic group \(C_4\) or the Klein 4-group \(V_4 = C_2 \times C_2\), or the dihedral group \(D_4\). Secondly, they consider the more difficult case of primitive quartic fields \(L\) (no quadratic subfields). In fact, if \(N\) is a Galois closure of a quartic extension \(L/{\mathbb{Q}}\), then the Galois group of \(N/{\mathbb{Q}}\) is isomorphic to the alternating group \(A_4\) or the symmetric group \(S_4\). The number field \(N\) has a unique cubic subfield \(K\), which is cyclic over \({\mathbb{Q}}\) only in the case of \(A_4\). The cubic field \(K\) is obtained directly if \(K\) is cyclic and by Belabas's methods if \(K\) is noncyclic. Knowing that the quartic field \(L\) comes from the quadratic extension \(K(\sqrt{\alpha})\), where \({\mathcal N}_{K/{\mathbb{Q}}}(\alpha)\) is a square in \({\mathbb{Q}}\), the tables of \(L\) are constructed from those of \(K\). The authors have used these techniques to find all quartic fields with discriminant up to \(10^7\).
      0 references

      Identifiers