Bounds of Multiplicative Character Sums over Shifted Primes

2021 ◽  
Vol 314 (1) ◽  
pp. 64-89
Author(s):  
Bryce Kerr
2018 ◽  
Vol 2020 (10) ◽  
pp. 2881-2917 ◽  
Author(s):  
Junyan Xu

Abstract We prove a stratification result for certain families of n-dimensional (complete algebraic) multiplicative character sums. The character sums we consider are sums of products of r multiplicative characters evaluated at rational functions, and the families (with nr parameters) are obtained by allowing each of the r rational functions to be replaced by an “offset”, that is, a translate, of itself. For very general such families, we show that the stratum of the parameter space on which the character sum has maximum weight $n+j$ has codimension at least j⌊(r − 1)/2(n − 1)⌋ for 1 ≤ j ≤ n − 1 and ⌈nr/2⌉ for j = n. This result is used to obtain multivariate Burgess bounds in joint work with Lillian Pierce.


2010 ◽  
Vol 53 (1) ◽  
pp. 1-12 ◽  
Author(s):  
Omran Ahmadi ◽  
Igor Shparlinski

AbstractLet E be an ordinary elliptic curve over a finite field q of q elements. We improve a bound on bilinear additive character sums over points on E, and obtain its analogue for bilinear multiplicative character sums. We apply these bounds to some variants of the sum-product problem on E.


2011 ◽  
Vol 07 (06) ◽  
pp. 1557-1571 ◽  
Author(s):  
ALINA OSTAFE ◽  
IGOR E. SHPARLINSKI ◽  
ARNE WINTERHOF

We estimate multiplicative character sums along the orbits of a class of nonlinear recurrence vector sequences. In the one-dimensional case, only much weaker estimates are known and our results have no one-dimensional analogs.


2008 ◽  
Vol 50 (3) ◽  
pp. 523-529 ◽  
Author(s):  
IGOR E. SHPARLINSKI

AbstractWe consider the equation over a finite field q of q elements, with variables from arbitrary sets $\cA,\cB, \cC, \cD \subseteq \F_q$. The question of solvability of such and more general equations has recently been considered by Hart and Iosevich, who, in particular, prove that if for some absolute constant C > 0, then above equation has a solution for any λ ∈ q*. Here we show that using bounds of multiplicative character sums allows us to extend the class of sets which satisfy this property.


2009 ◽  
Vol 46 (2) ◽  
pp. 223-229
Author(s):  
Sanka Balasuriya ◽  
Igor Shparlinski ◽  
Daniel Sutantyo

We give upper bounds for sums of multiplicative characters modulo an integer q ≧ 2 with the Euler function ϕ ( n ) and with the shifted largest prime divisor P ( n ) + a of integers n ≦ x .


2011 ◽  
Vol 83 (3) ◽  
pp. 456-462 ◽  
Author(s):  
IGOR E. SHPARLINSKI

AbstractGiven a prime p, the Fermat quotient qp(u) of u with gcd (u,p)=1 is defined by the conditions We derive a new bound on multiplicative character sums with Fermat quotients qp(ℓ) at prime arguments ℓ.


Sign in / Sign up

Export Citation Format

Share Document