Multiplicative energy of polynomial images of intervals modulo \(q\)
Summary: 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\subset\mathbb{Z}_q\) under a polynomial \(f\in\mathbb{Z}[X]\).
scientific article; zbMATH DE number 6966785