A modular method for computing the Galois groups of polynomials (Q1358933): Difference between revisions

Along the lines of \textit{R. Stauduhar} [Math. Comput. 27, 981-996 (1973; Zbl 0282.12004)], the author presents a new approach for the computation of the Galois group of a rational polynomial \(f\). As in [\textit{H. Darmon} and \textit{D. Ford}, Commun. Algebra 17, No. 12, 2941-2943 (1989; Zbl 0693.12010)], \(p\)-adic approximations of the roots are used but the polynomial is not required to split completely modulo \(p\). Integrality of specialized invariants is tested via idempotents in the factor ring \(k[x_1,\ldots,x_n]/(s_i-f_i)\) (where the \(s_i\) are the elementary symmetric functions), which is represented by a Gröbner basis. The paper analyzes bounds for the required accuracy and the complexity of the lifting process (assuming knowledge of the subgroup lattice of the symmetric group). It closes with example runtimes for some groups of degree up to 7 which are compared to the implementation in Maple following \textit{T. Mattman} and \textit{J. McKay} [Math. Comput. 66, No. 218, 823-831 (1997)].