Value Sets of Sparse Polynomials

We obtain a new lower bound on the size of the value set of a sparse polynomial over a finite field of elements when is prime. This bound is uniform with respect to the degree and depends on some natural arithmetic properties of the degrees of the monomial terms of and the number of these terms. Our result is stronger than those that can be extracted from the bounds on multiplicities of individual values in