Fast Decomposition Of Polynomials With Known Galois Group

A Enge,F Morain

AAECC'03: Proceedings of the 15th international conference on Applied algebra, algebraic algorithms and error-correcting codes(2003)

引用 11|浏览14
暂无评分
摘要
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.
更多
查看译文
关键词
extension M,field extension M,Hilbert class field,field K,imaginary quadratic field,intermediate field,longer Galois,polynomial arithmetic,separable polynomial,general case,Galois group,fast decomposition
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要