Study of algebraic relations between the roots of a univariate polynomial (Q1971022)

One way to approach Galois theory is to study the relations among the roots of a polynomial \(f\). A relation is a polynomial of \(n\) variables, where \(n\) is the degree of \(f\). This paper deals with effective computation in Galois theory. The author gives a recursive algorithm to construct a generating system for the ideal of relations of the roots of a polynomial of one variable over a perfect field. This is done first by defining new ideals associated to the given polynomial. These ideals are defined between the ideal of symmetric relations and the ideal of relations. Finally a correspondence is given between these ideals and finite sets of permutations. The correspondence is obtained by using some polynomials of several variables associated to the ideals. These polynomials characterize the ideals and allow to construct a generating system for them.