Double Character Sums over Subgroups and Intervals
Number Theory
2014-05-21 v2
Abstract
We estimate double sums with a multiplicative character modulo where and is a subgroup of order of the multiplicative group of the finite field of elements. A nontrivial upper bound on can be derived from the Burgess bound if and from some standard elementary arguments if , where is arbitrary. We obtain a nontrivial estimate in a wider range of parameters and . We also estimate double sums and give an application to primitive roots modulo with non-zero binary digits.
Cite
@article{arxiv.1401.6611,
title = {Double Character Sums over Subgroups and Intervals},
author = {Mei-Chu Chang and Igor E. Shparlinski},
journal= {arXiv preprint arXiv:1401.6611},
year = {2014}
}