Galois group computation for rational polynomials

DOI10.1006/jsco.2000.0377zbMath0960.11054OpenAlexW2087869270MaRDI QIDQ5927989

Jürgen Klüners, Katharina Geissler

Publication date: 19 March 2001

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/a14cef8e58002f4fb7644473c23d8e6d973f46ba

zbMATH Keywords

algorithmsGalois grouppolynomials

Mathematics Subject Classification ID

Related Items (18)

Effective Invariant Theory of Permutation Groups Using Representation Theory ⋮ Covariant algebra of the binary nonic and the binary decimic ⋮ Efficient arithmetic in successive algebraic extension fields using symmetries ⋮ Galois groups over rational function fields and explicit Hilbert irreducibility ⋮ Improved methods for the construction of relative invariants for permutation groups ⋮ A note on the unsolvability of the weighted region shortest path problem ⋮ Using Galois ideals for computing relative resolvents ⋮ Explicit Galois realization of transitive groups of degree up to 15 ⋮ A polynomial with Galois group \(\text{SL}_2(11)\) ⋮ Computation of Galois groups of rational polynomials ⋮ ON THE FIELD INTERSECTION PROBLEM OF SOLVABLE QUINTIC GENERIC POLYNOMIALS ⋮ GENERALIZED EXPLICIT DESCENT AND ITS APPLICATION TO CURVES OF GENUS 3 ⋮ Exact algorithms for \(p\)-adic fields and epsilon constant conjectures ⋮ A Polynomial with Galois Groups SL₂(F₁₆) ⋮ Invariants for the computation of intransitive and transitive Galois groups ⋮ A Note on Short Cosets ⋮ Computing Galois groups of polynomials (especially over function fields of prime characteristic) ⋮ Computations of Galois representations associated to modular forms of level one

Uses Software

• KANT/KASH

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the computation of resolvents and Galois groups
• Computing Galois groups over the rationals
• Solvability by radicals is in polynomial time
• Factoring polynomials with rational coefficients
• On computing subfields. A detailed description of the algorithm
• A modular method for computing the Galois groups of polynomials
• KANT V4
• On computing subfields
• Computational verification of M₁₁and M₁₂as galois groups over Q
• Computation of Galois groups over function fields
• Factoring Polynomials over Algebraic Number Fields
• Computing automorphisms of abelian number fields
• Symmetric Functions, m-Sets, and Galois Groups
• The Determination of Galois Groups
• Explicit Galois realization of transitive groups of degree up to 15

This page was built for publication: Galois group computation for rational polynomials