Invariants for the computation of intransitive and transitive Galois groups

Authors:
Andreas-Stephan Elsenhans
Affiliations:
-
Venue:
Journal of Symbolic Computation
Year:
2012

Citing 4
Cited 0

Algorithms in invariant theory

Algorithms in invariant theory
The MAGMA algebra system I: the user language

Journal of Symbolic Computation - Special issue on computational algebra and number theory: proceedings of the first MAGMA conference
Galois group computation for rational polynomials

Journal of Symbolic Computation - Algorithmic methods in Galois Theory
Constructing transitive permutation groups

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

One hard step in the computation of Galois groups by Stauduhar's method is the construction of relative invariants. In this note, a representation-theoretic approach is given for the construction in the case of an intransitive group. In the second part of the article, it is shown that the construction can be used for groups that have a suitable intransitive subgroup. The construction solves an open question of Fieker and Kluners.