Galois group computation for rational polynomials

DOI10.1006/JSCO.2000.0377MaRDI QIDQ5927989zbMATH OpenOpenAlexFDO

Authors Katharina Geissler, Jürgen Klüners

Publication date 19 March 2001

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/a14cef8e58002f4fb7644473c23d8e6d973f46ba

zbMATH Keywords

algorithmsGalois grouppolynomials

Mathematics Subject Classification ID

Galois theory (11R32) Algebraic number theory computations (11Y40) Separable extensions, Galois theory (12F10) Symbolic computation and algebraic computation (68W30)

Review text

The authors present a method to determine the Galois group of an irreducible polynomial with rational coefficients. It extends the approach by \textit{R. Stauduhar} [Math. Comput. 27, 981-996 (1973; Zbl 0282.12004)]. To avoid rounding errors \(p\)-adic approximation of the roots is used. NEWLINENEWLINENEWLINEA main difficulty in the descent from \(S_n\) to the Galois group is the large index of most maximal subgroups of \(S_n\) and \(A_n\): In the case that the Galois group is imprimitive, information about subfields is used to descend to a wreath product without computing a resolvent. (This has been suggested before by the reviewer in [Groups St. Andrews 1997 in Bath. Vol. 2, 379-393 (1999; Zbl 0923.12003)]). NEWLINENEWLINENEWLINEIn the case that the Galois group is imprimitive, the resolvent is reduced by using the property that the Frobenius homomorphism (whose action on the \(p\)-adic approximations of the roots is known) must be contained in the Galois group. NEWLINENEWLINENEWLINETo verify approximative results, factors of absolute resolvents are used. NEWLINENEWLINENEWLINEThe method has been implemented for degree up to 15, runtime measurements are given.

Recommendations

• Computation of Galois groups of rational polynomials
• scientific article; zbMATH DE number 4112724
• Computation of the Galois group of a polynomial with rational coefficients. I
• Computing Galois groups over the rationals
• Computation of the Galois group of a polynomial with rational coefficients. II
• Computing Galois groups of certain families of polynomials
• Computing Galois groups of polynomials (especially over function fields of prime characteristic)
• Galois groups of polynomials
• A modular method for computing the Galois groups of polynomials
• Computing the Galois group of a polynomial over a p-adic field

Cites work

• A modular method for computing the Galois groups of polynomials
• Computation of Galois groups over function fields
• Computational verification of M₁₁and M₁₂as galois groups over Q
• Computing automorphisms of abelian number fields
• Computing Galois groups over the rationals
• Explicit Galois realization of transitive groups of degree up to 15
• Factoring Polynomials over Algebraic Number Fields
• Factoring polynomials with rational coefficients
• scientific article; zbMATH DE number 3056335 (Why is no real title available?)
• scientific article; zbMATH DE number 3067687 (Why is no real title available?)
• KANT V4
• Modern computer algebra
• On computing subfields
• On computing subfields. A detailed description of the algorithm
• On the computation of resolvents and Galois groups
• Solvability by radicals is in polynomial time
• Symmetric Functions, m-Sets, and Galois Groups
• The Determination of Galois Groups

Cited in

(32)

• A modular method for computing the Galois groups of polynomials
• Efficient arithmetic in successive algebraic extension fields using symmetries
• Galois groups over rational function fields and explicit Hilbert irreducibility
• A note on the unsolvability of the weighted region shortest path problem
• Computing Galois groups of polynomials (especially over function fields of prime characteristic)
• Generalized explicit descent and its application to curves of genus 3
• Computations of Galois representations associated to modular forms of level one
• Effective Invariant Theory of Permutation Groups Using Representation Theory
• Resolvents, masses, and Galois groups of irreducible quartic polynomials
• Computation of the Galois group of a polynomial with rational coefficients. II
• A Polynomial with Galois Groups SL₂(F₁₆)
• scientific article; zbMATH DE number 3855240 (Why is no real title available?)
• Galois groups of prime degree polynomials with nonreal roots
• scientific article; zbMATH DE number 1302467 (Why is no real title available?)
• scientific article; zbMATH DE number 1057746 (Why is no real title available?)
• Fast Decomposition of Polynomials with Known Galois Group
• Deciding the nilpotency of the Galois group by computing elements in the centre
• On the field intersection problem of solvable quintic generic polynomials
• Computing the Galois group of a polynomial over a p-adic field
• Improved methods for the construction of relative invariants for permutation groups
• Computation of Galois groups of rational polynomials
• Covariant algebra of the binary nonic and the binary decimic
• Computation of the Galois group of a polynomial with rational coefficients. I
• A note on short cosets
• Using Galois ideals for computing relative resolvents
• Explicit Galois realization of transitive groups of degree up to 15
• A polynomial with Galois group \(\text{SL}_2(11)\)
• Galois groups and the factorization of polynomials
• Computing Galois groups
• Galois groups of uplifted de Sitter vacua
• Exact algorithms for p-adic fields and epsilon constant conjectures
• Invariants for the computation of intransitive and transitive Galois groups

Describes a project that uses

Uses Software

• KANT/KASH

This page was built for publication: Galois group computation for rational polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5927989)