Abstract
This paper deals with the effective computation of the radical of certain polynomial ideals. Let k be a characteristic zero field, f1,…, fn−r ε k[X1,…, Xn] a regular sequence with d:=maxj deg fj, (Formula presented.) the generated ideal (Formula presented.) its radical, and suppose that the factor ring (Formula presented.) is a Cohen-Macaulay ring. Under these assumptions we exhibit a single exponential algorithm which computes a system of generators of (Formula presented.).
Cite
CITATION STYLE
Armendáriz, I., & Solernó, P. (1995). On the computation of the radical of polynomial complete intersection ideals. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 948, pp. 106–119). Springer Verlag. https://doi.org/10.1007/3-540-60114-7_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
