Invariants for the computation of intransitive and transitive Galois groups

DOI10.1016/j.jsc.2011.11.006zbMath1257.12006MaRDI QIDQ765862

Andreas-Stephan Elsenhans

Publication date: 22 March 2012

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

Full work available at URL: https://doi.org/10.1016/j.jsc.2011.11.006

zbMATH Keywords

algorithm; Galois group; representation theory; invariant polynomial; intransitive subgroup

Mathematics Subject Classification ID

11R32: Galois theory

12F10: Separable extensions, Galois theory

Related Items

Computation of Galois groups of rational polynomials, A Note on Short Cosets, Improved methods for the construction of relative invariants for permutation groups, Computing Galois groups of polynomials (especially over function fields of prime characteristic), Computation of Galois Groups in magma

Uses Software

• Magma

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimizing representations over number fields. II: Computations in the Brauer group.
• The Magma algebra system. I: The user language
• Constructing transitive permutation groups.
• Computing maximal subgroups of finite groups.
• On the Brauer-Manin obstruction for cubic surfaces
• The Transitive Permutation Groups of Degree 32
• On Invariant Polynomials and Their Application in Field Theory
• The Determination of Galois Groups
• CUBIC SURFACES WITH A GALOIS INVARIANT PAIR OF STEINER TRIHEDRA
• Endliche Gruppen I
• Algorithms in invariant theory
• Galois group computation for rational polynomials