Galois group computation for rational polynomials (Q5927989): Difference between revisions

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. A 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)]). In 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. To verify approximative results, factors of absolute resolvents are used. The method has been implemented for degree up to 15, runtime measurements are given.