Deciding the nilpotency of the Galois group by computing elements in the centre (Q4813623)

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 2091018
Language Label Description Also known as
default for all languages
No label defined
    English
    Deciding the nilpotency of the Galois group by computing elements in the centre
    scientific article; zbMATH DE number 2091018

      Statements

      Deciding the nilpotency of the Galois group by computing elements in the centre (English)
      0 references
      13 August 2004
      0 references
      Galois group computation
      0 references
      Galois theory
      0 references
      automorphism group
      0 references
      Starting with a (not necessarily irreducible) polynomial \(f \in \mathbb Q[x]\) and the associated ring \(R := \mathbb Q[x]/(f)\), the authors address two different, but related, questions: The first involves the computation of certain \(\mathbb Q\)-automorphisms of \(R\), the second the determination of the structure of the Galois group of \(f\), i.e. the automorphism group of a minimal splitting field of \(f\). Essentially using the same techniques as \textit{J. Klüners} and \textit{V. Acciaro} [Math. Comput. 68, 1179--1186 (1999; Zbl 0937.11062)], namely Newton (or Hensel) lifting of Frobenius automorphisms of residue class fields, they are able to compute all central \(\mathbb Q\)-automorphisms of \(R\), i.e. \(Z(\Aut(\mathbb{Q}, R))\). The main application of their technique is the computation of the Galois group of \(f\) in the case it is a nilpotent group. While the computation of Galois groups is possible for irreducible polynomials \(f\) of degree up to \(23\) [\textit{K. Geissler} and \textit{J. Klüners}, J. Symb. Comput. 30, No. 6, 653--674 (2000; Zbl 0960.11054)], the new method has no degree limit: they give an example of a non-normal degree \(72\) polynomial which is completely inaccessible with previous methods. In the nilpotent case, the methods uses central elements to construct polynomials corresponding to the \(p\)-Sylow subgroups of the Galois groups. For the \(p\)-groups obtained thus, they suggest using either classical methods (if the degree is not too large) or a special factorisation based approach based of the explicit construction used in this article and the \(p\)-group property. As a by-product, the proposed method can also be used to decide if a given polynomial has nilpotent Galois group. The paper contains several examples illustrating the various steps of the overall procedure.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references