J4 ›› 2011, Vol. 49 ›› Issue (05): 819-822.

• 数学 • 上一篇    下一篇

基于结式的判别子域问题算法

付治国1, 夏德胜2, 刘首硕3   

  1. 1. 吉林大学 数学学院, 长春 130012|2. 吉林大学 软件学院, 长春 130012;3. 空军航空大学 特种专业系, 长春 130022
  • 收稿日期:2011-03-28 出版日期:2011-09-26 发布日期:2011-09-27
  • 通讯作者: 付治国 E-mail:fuzg@jlu.edu.cn

Algorithm for the Subfield Problem Based on the Resultant

FU Zhiguo1, XIA Desheng2, LIU Shoushuo3   

  1. 1. College of Mathematics, Jilin University, Changchun 130012, China;2. College of Software, Jilin University, Changchun 130012, China;3. Department of Special Professional, |Aviation University of Air Force, Changchun 130022, China
  • Received:2011-03-28 Online:2011-09-26 Published:2011-09-27
  • Contact: FU Zhiguo E-mail:fuzg@jlu.edu.cn

摘要:

提出一种基于数域上极小多项式结式的算法, 解决了判别子域问题. 算法能保证成功运行, 并且在模p下因式分解只提升某些特定因子. 结果表明, 在大多数情况下, 该算法比基于数域上因式分解的算法更有效.

关键词: 子域问题, 结式, 同构

Abstract:

This paper presents an algorithm for the subfield problem based on the minimal polynomials of the number fields. The algorithm is guaranteed to success and only lifts some special factors after factoring polynomials mod p. The experimental results show that it is more efficient than the algorithm based on the factorization over number fields in most cases.

Key words: subfield problem, resultant, isomorphism

中图分类号: 

  • O156.2