4 citations · 16 across the 30 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
math.NT2017
A refinement of the Burgess bound for character sums
Bryce Kerr, Igor E. Shparlinski, Kam Hung Yau
In this paper we give a refinement of the bound of D. A. Burgess for multiplicative character sums modulo a prime number . This continues a series of previous logarithmic improv…
math.NT2017
On the exponential large sieve inequality for sparse sequences modulo primes
Mei-Chu Chang, Bryce Kerr, Igor E. Shparlinski
We complement the argument of M. Z. Garaev (2009) with several other ideas to obtain a stronger version of the large sieve inequality with sparse exponential sequences of the form…
math.NT2017
Incomplete Gauss sums modulo primes
Bryce Kerr
We obtain a new bound for incomplete Gauss sums modulo primes. Our argument falls under the framework of Vinogradov's method which we use to reduce the problem under consideration…