Mixed character sums modulo prime powers
Abstract
We obtain explicit estimates for the mixed character sum S= S(,g,f,pm) = Σx=1pm (g(x)) epm(f(x)), where pm is a prime power, is a multiplicative character mod pm and f,g are rational functions over Q. Let f=f+/f-, g=g+/g- in reduced form, and set D=deg(f)+Z-1 where Z is the number of distinct complex zeros of f-g+g-, and = deg(f)+deg(g) for polynomial f,g, =2(deg(f)+deg(g)) otherwise. We show for example that for odd p, any non-degenerate sum has |S| 34/3\, pm(1- 1D) if degp(f) 1, and |S| 34/3\, pm(1- 1) if degp(g) 1. Analogous bounds are given for degenerate sums.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.