Multiplicative energy of polynomial images of intervals modulo q.

Given a smooth integer q, we use existing upper bounds for character sums to find a lower bound for the size of a multiplicative subgroup of the integers modulo q which contains the image of an interval of consecutive integers I ⊂ Zq under a polynomial f ∊ Z[X]. [ABSTRACT FROM AUTHOR]