Computational verification of M11and M12as galois groups over Q

From MaRDI portal
Publication:3035402





The action of Frobenius gives lower bounds on Galois groups by delivering the shape of permutations in \(\mathrm{Gal}\, f\) as partitions of \(\deg f\) as degrees of irreducible factors of \(f \bmod p_i\) \((p_i\) not dividing \(\operatorname{disc}(f))\). Upper bounds may be found by proving that the values of polynomial invariants of \(G\) are rational integers when evaluated on the roots of \(f\). Two Matzat polynomials, with the Mathieu groups of degree \(11, 12\), respectively, as expected Galois groups, are verified. The need is to prove that the invariant (here defined as a sum of blocks of a Steiner system) takes a rational integer value -- an approximation in itself is insufficient. With \(p\), a splitting prime for \(f\), \(p\)-adic approximation is used together with a proof of the result that if a good enough \(p\)-adic approximation exists, it is exact. The computations take about 7 and 14 hours respectively on a VAX 8550.











This page was built for publication: Computational verification of M11and M12as galois groups over Q

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