Computational verification of M<sub>11</sub>and M<sub>12</sub>as galois groups over Q (Q3035402)

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 4134173
Language Label Description Also known as
default for all languages
No label defined
    English
    Computational verification of M<sub>11</sub>and M<sub>12</sub>as galois groups over Q
    scientific article; zbMATH DE number 4134173

      Statements

      Computational verification of M<sub>11</sub>and M<sub>12</sub>as galois groups over Q (English)
      0 references
      1989
      0 references
      inverse Galois problem
      0 references
      Matzat polynomials
      0 references
      Mathieu groups
      0 references
      Galois groups
      0 references
      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.
      0 references

      Identifiers

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