Computational verification of M11and M12as galois groups over Q

DOI10.1080/00927878908823887zbMath0693.12010OpenAlexW2112408095MaRDI QIDQ3035402

No author found.

Publication date: 1989

Published in: Communications in Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00927878908823887

zbMATH Keywords

Galois groupsinverse Galois problemMathieu groupsMatzat polynomials

Mathematics Subject Classification ID

Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Galois theory (11R32) Algebraic number theory computations (11Y40) Inverse Galois theory (12F12)

Related Items (7)

Deciding the nilpotency of the Galois group by computing elements in the centre ⋮ A modular method for computing the Galois groups of polynomials ⋮ Using Galois ideals for computing relative resolvents ⋮ Galois group computation for rational polynomials ⋮ Special issue: Algorithmic methods in Galois theory ⋮ Computation of Galois groups over function fields ⋮ Computing Galois groups of polynomials (especially over function fields of prime characteristic)

Cites Work

• Realization of the Mathieu groups \(M_{11}\) and \(M_{12}\) as Galois groups over \({\mathbb Q})\).
• Polynomials with PSL(2,7) as Galois group

This page was built for publication: Computational verification of M₁₁and M₁₂as galois groups over Q