The elementary symmetrical polynomials (ESP's) are polynomials in n indeterminates that are symmetrical, that is, they don't change under the permuation of the indeterminates.
They are defined as follows.
S1(t1, t2, , tn) = t1 + t2 + + tn
S2(t1, t2, , tn) = t1t2 + t1t3 + + t1tn + t2t3 + t2t4 + + t2tn + t3t4 + + tn-1tn
S3(t1, t2, , tn) = t1t2t3 + t1t2t4 + + t1t2tn + + t1tn-1tn + + tn-2tn-1tn
Sn(t1, t2, , tn) = t1t2 tn
In other words, Sk exists of a sum of all permutations of products of precisely k different tj. There are such permutations for a given n and k.
A more formal way of defining the ESP's is
The Newton Symmetric Polynomials (NSP's) on (t1 t2 tn) are the polynomials
For a fixed n, the set { S1, S2, ..., Sn } is linearly independend; they cannot be expressed into eachother. Since there are n indeterminates and n elementary symmetric polynomials, they form a basis for the set of symmetric polynomials of n indeterminates. The same holds for the set { N1, N2, ..., Nn }. Every symmetric polynomial can be expressed as a polynomial of the ESP's or NSP's, in particular they can be expressed into eachother.
A recursive formula that expresses one into the other still looks reasonably simple. Therefore this is the prefered way. For a fixed n the relationship is given by
from which it is easy to derive the reverse relationship
Both cases exist of a sum with k - 1 leading terms, followed by the last term. In particular, N1 = S1.