Short character sums of inhomogeneous polynomials

Source abstract

Let $p$ be a prime. We prove nontrivial bounds on short sums of Dirichlet characters mod $p$ evaluated at a class of polynomials, not necessarily homogeneous, in $n$ variables and of degree $k$. For large $n$, we further achieve nontrivial bounds for sums over boxes with side-lengths as short as $p^{1/(k-1)+\varepsilon}$, which breaks past the Burgess barrier of $p^{1/4+\varepsilon}$ as soon as $k\geq 6$. In the proof, we develop a new variation of the Burgess amplification method that reduces the problem to bounding additive character sums. This is the first case in which a Burgess-type method succeeds in the inhomogeneous setting.