Invariants for the computation of intransitive and transitive Galois groups

被引：5
|
作者：
Elsenhans, Andreas-Stephan [1 ]
机构：
[1] Univ Bayreuth, Math Inst, D-95447 Bayreuth, Germany
来源：
JOURNAL OF SYMBOLIC COMPUTATION | 2012年 / 47卷 / 03期
关键词：
Galois group; Invariant; Representation; Algorithm; PERMUTATION-GROUPS; POLYNOMIALS;
D O I：
10.1016/j.jsc.2011.11.006
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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. (C) 2011 Elsevier Ltd. All rights reserved.
引用
收藏
页码：315 / 326
页数：12
相关论文
共 50 条
12345