We propose a new algorithm for the computation of the radical of an ideal in a polynomial
ring. In recent years many algorithms have been proposed. A common technique used is to …

Computation of real radicals of polynomial ideals - II Page 1 JOURNAL OF PURE AND APPLIED
ALGEBRA ELSEVIER Journal of Pure and Applied Algebra 124 (1998) 261-280 Computation of …

The first solution to the problem of the construction of the radical of an ideal was (implicitly)
given by Hermann [13]. In her paper in fact she showed that it is possible to give a …

The computation of the radical of a zero-dimensional ideal plays an important role in various
areas of computer algebra. A bunch of different methods have been published to meet this …

In this paper we are concerned with the computation of prime decompositions of radicals in
polynomial rings over a noetherian commutative ring R with identity. We show that prime …

This paper deals with the effective computation of the radical of certain polynomial ideals.
Let k be a characteristic zero field, f 1,..., fn− r ε k [X 1,..., X n] a regular sequence with d …

Computation of Real Radicals of Polynomial Ideals Page 1 Computation of Real Radicals of
Polynomial Ideals E. Becker R. Neuhaus Abstract. We describe an algorithm for the …

We propose a method for computing the radical of an arbitrary ideal in the polynomial ring in
n variables over a perfect field of characteristic p> 0. In our method Buchberger's algorithm is …

I of a given ideal I⊴ K [x1,..., xn] in a polynomial ring is one of the basic tasks in
computational commutative algebra. For example, radical computation is an ingredient in de …

We present an algorithm to compute a primary decomposition of an ideal in a polynomial
ring over the integers. For this purpose we use algorithms for primary decomposition in …