Computation of Galois groups of rational polynomials
From MaRDI portal
Publication:5170255
Abstract: Computational Galois theory, in particular the problem of computing the Galois group of a given polynomial is a very old problem. Currently, the best algorithmic solution is Stauduhar's method. Computationally, one of the key challenges in the application of Stauduhar's method is to find, for a given pair of groups H<G a G-relative H-invariant, that is a multivariate polynomial F that is H-invariant, but not G-invariant. While generic, theoretical methods are known to find such F, in general they yield impractical answers. We give a general method for computing invariants of large degree which improves on previous known methods, as well as various special invariants that are derived from the structure of the groups. We then apply our new invariants to the task of computing the Galois groups of polynomials over the rational numbers, resulting in the first practical degree independent algorithm.
Recommendations
- Invariants for the computation of intransitive and transitive Galois groups
- Improved methods for the construction of relative invariants for permutation groups
- A modular method for computing the Galois groups of polynomials
- Computing Galois groups of polynomials (especially over function fields of prime characteristic)
- scientific article; zbMATH DE number 1302467
Cites work
- A Database for Field Extensions of the Rationals
- Calculs d'invariants primitifs de groupes finis
- Explicit Galois realization of transitive groups of degree up to 15
- Galois group computation for rational polynomials
- Generating subfields
- Identifying Frobenius elements in Galois groups
- Invariants for the computation of intransitive and transitive Galois groups
- On Transitive Permutation Groups
- On the computation of resolvents and Galois groups
- Structure and finiteness properties of subdirect products of groups
Cited in
(28)- Computing Galois groups of Fano problems
- Computing splitting fields using Galois theory and other Galois constructions
- Computing Galois groups of polynomials (especially over function fields of prime characteristic)
- A modular method for computing the Galois groups of polynomials
- Computing the Galois group of a polynomial over a \(p\)-adic field
- A note on short cosets
- Galois groups in a family of dynatomic polynomials
- Galois groups over rational function fields and explicit Hilbert irreducibility
- Dynatomic Galois groups for a family of quadratic rational maps
- Fast Decomposition of Polynomials with Known Galois Group
- Hilbert's irreducibility, modular forms, and computation of certain Galois groups
- A finiteness theorem for specializations of dynatomic polynomials
- Computing subfields of number fields and applications to Galois group computations
- Algorithmic Number Theory
- scientific article; zbMATH DE number 1057767 (Why is no real title available?)
- Computation of the Galois group of a polynomial with rational coefficients. I
- Computing Galois groups
- Calculation of Galois groups over number and function fields
- ALGORITHMS FOR GALOIS GROUP COMPUTATIONS OVER MULTIVARIATE FUNCTION FIELDS
- Computing Galois groups of Ehrhart polynomials in OSCAR
- Computational group theory. Abstracts from the workshop held August 15--21, 2021 (hybrid meeting)
- Improved methods for the construction of relative invariants for permutation groups
- scientific article; zbMATH DE number 17525 (Why is no real title available?)
- Numerical computation of Galois groups
- Computation of Galois groups in Magma
- Galois group computation for rational polynomials
- Computation of geometric Galois groups and absolute factorizations
- Certification of modular Galois representations
This page was built for publication: Computation of Galois groups of rational polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5170255)
