Burgess-Type Bounds for Character Sums over Fpn
Abstract
We establish Burgess-type bounds for short multiplicative character sums over finite fields Fpn under a purely volumetric condition. We show that for a box B ⊂ Fpn, nontrivial cancellation occurs whenever |B| pn(1/4+), without imposing lower bounds on the individual side lengths. This removes the coordinate-wise restrictions present in earlier results and extends work of Gabdullin for n=2,3 to arbitrary dimension. The proof combines methods from the geometry of numbers with multiplicative energy estimates and bounds for character sums due to Katz.
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.