Double Character Sums over Subgroups and Intervals

Abstract

We estimate double sums S(a, I, G) = Σx ∈ I Σλ ∈ G (x + aλ), 1 a < p-1, with a multiplicative character modulo p where I= \1,…, H\ and G is a subgroup of order T of the multiplicative group of the finite field of p elements. A nontrivial upper bound on S(a, I, G) can be derived from the Burgess bound if H p1/4+ and from some standard elementary arguments if T p1/2+, where >0 is arbitrary. We obtain a nontrivial estimate in a wider range of parameters H and T. We also estimate double sums T(a, G) = Σλ, μ ∈ G (a + λ + μ), 1 a < p-1, and give an application to primitive roots modulo p with 3 non-zero binary digits.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…