Computing polynomial univariate representations of zero-dimensional ideals by Grobner basis

Rational Univariate Representation （RUR） of zero-dimensional ideals is used to describe the zeros of zero-dimensional ideals and RUR has been studied extensively. In 1999, Roullier proposed an efficient algorithm to compute RUR of zero-dimensional ideals. In this paper, we will present a new algorithm to compute Polynomial Univariate Representation （PUR） of zero-dimensional ideals. The new algorithm is based on some interesting properties of Grobner basis. The new algorithm also provides a method for testing separating elements.