Solving zero-dimensional systems through the rational univariate representation

This paper is devoted to the resolution of zero-dimensional systems in K[X- 1,...X-n], where K is a field of characteristic zero (or strictly positive under some conditions). We follow the definition used in [19] and basically due to Kronecker for solving zero-dimensional systems: A system is solved if each root is represented in such way as to allow the performance of any arithmetical operations over the arithmetical expressions of its coordinate s. We propose new definitions for solving zero-dimensional systems in this sense by introducing the Univariate Representation of their roots. We show by this way that the solutions of any zero-dimensional system of polynomial s can be expressed through a special kind of univariate representation (Rat ional Univariate Representation): {f(T) = 0, X-1 = gq(T)/g(T), ... , X-n = gn(T)/g(T)} where (f, g, g(l),..., g(n),) are polynomials of K[X-l, ..., X-n]. A specia l feature of our Rational Univariate Representation is that we don't loose geometrical information contained in the initial system. Moreover we propos e different efficient algorithms for the computation of the Rational Univar iate Representation, and we make a comparison with standard known tools.