Lower bounds on odd order character sums

Abstract: A classical result of Paley shows that there are infinitely many quadratic characters $\chi\mod{q}$ whose character sums get as large as $\sqrt{q}\log \log q$; this implies that a conditional upper bound of Montgomery and Vaughan cannot be improved. In this paper, we derive analogous lower bounds on character sums for characters of odd order, which are best possible in view of the corresponding conditional upper bounds recently obtained by the first author.