Computing Galois groups of polynomials (especially over function fields of prime characteristic)
From MaRDI portal
Publication:2348291
DOI10.1016/j.jsc.2014.09.043zbMath1393.11073OpenAlexW2039291648MaRDI QIDQ2348291
Publication date: 11 June 2015
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2014.09.043
Related Items (4)
DETERMINING GALOIS GROUPS OF REDUCIBLE POLYNOMIALS VIA DISCRIMINANTS AND LINEAR RESOLVENTS ⋮ Galois groups over rational function fields and explicit Hilbert irreducibility ⋮ ALGORITHMS FOR GALOIS EXTENSIONS OF GLOBAL FUNCTION FIELDS ⋮ Computing splitting fields using Galois theory and other Galois constructions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algebraic function fields and codes
- Invariants for the computation of intransitive and transitive Galois groups
- Computing Galois groups over the rationals
- A modular method for computing the Galois groups of polynomials
- Fast recognition of alternating and symmetric Galois groups
- Constructing transitive permutation groups.
- Computing maximal subgroups of finite groups.
- Computational verification of M11and M12as galois groups over Q
- Computation of Galois groups over function fields
- The Transitive Permutation Groups of Degree 32
- Symmetric Functions, m-Sets, and Galois Groups
- The Determination of Galois Groups
- Computation of Galois groups of rational polynomials
- Generating subfields
- A Note on Short Cosets
- Galois group computation for rational polynomials
This page was built for publication: Computing Galois groups of polynomials (especially over function fields of prime characteristic)