当前位置: X-MOL 学术J. Syst. Sci. Complex. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Computing PUR of Zero-Dimensional Ideals of Breadth at Most One
Journal of Systems Science and Complexity ( IF 2.1 ) Pub Date : 2021-06-28 , DOI: 10.1007/s11424-021-9330-1
Jian Pan , Baoxin Shang , Zhe Li , Shugong Zhang

In this paper, for a zero-dimensional polynomial ideal I, the authors prove that k[x1, x2, ⋯, xn]/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.



中文翻译:

计算宽度至多为 1 的零维理想的 PUR

在本文中,对于零维多项式理想I,作者证明k [ x 1 , x 2 ,⋯, x n ]/ I是循环的当且仅当I的宽度为 0 或 1。此外,作者提出了一种新算法来计算这种理想的多项式单变量表示 (PUR)。

更新日期:2021-06-28
down
wechat
bug