Fast decomposition of polynomials with known Galois group

被引:0
|
作者
Enge, A [1 ]
Morain, F
机构
[1] Ecole Polytech, CNRS, LIX, FRE 2653, F-91128 Palaiseau, France
[2] INRIA Futurs, F-91128 Palaiseau, France
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Let f (X) be a separable polynomial with coefficients in a field K, generating a field extension M / K. If this extension is Galois with a solvable automorphism group, then the equation f (X) = 0 can be solved by radicals. The first step of the solution consists of splitting the extension M / K into intermediate fields. Such computations are classical, and we explain how fast polynomial arithmetic can be used to speed up the process. Moreover, we extend the algorithms to a more general case of extensions that are no longer Galois. Numerical examples are provided, including results obtained with our implementation for Hilbert class fields of imaginary quadratic fields.
引用
收藏
页码:254 / 264
页数:11
相关论文
共 50 条