Computing PUR of Zero-Dimensional Ideals of Breadth at Most One  

作　　者：PAN Jian SHANG Baoxin LI Zhe ZHANG Shugong 

机构地区：[1]School of Mathematics,Key Laboratory of Symbolic Computation and Knowledge Engineering(Ministry of Education),Jilin University,Changchun 130012,China [2]College of Science,Northeast Electric Power University,Jilin 132012,China [3]School of Science,Changchun University of Science and Technology,Changchun 130022,China

出　　处：《Journal of Systems Science & Complexity》2021年第6期2396-2409,共14页系统科学与复杂性学报（英文版）

基　　金：supported by the National Natural Science Foundation of China under Grant No.11671169。

摘　　要：In this paper,for a zero-dimensional polynomial ideal I,the authors prove that k[x_(1),x_(2),…,x_(n)]/I is cyclic if and only if the breadth of I is 0 or 1.Furthermore,the authors present a new algorithm to compute polynomial univariate representation(PUR)of such an ideal.

关 键 词：Cyclic basis Grobner basis polynomial univariate representation separating element 

分 类 号：O174.14[理学—数学]