scholarly journals On character sums in finite fields

1939 ◽  
Vol 71 (0) ◽  
pp. 99-121 ◽  
Author(s):  
H. Davenport
Keyword(s):  
2017 ◽  
Vol 46 ◽  
pp. 247-254 ◽  
Author(s):  
Abhishek Bhowmick ◽  
Thái Hoàng Lê ◽  
Yu-Ru Liu
Keyword(s):  

2016 ◽  
Vol 15 (07) ◽  
pp. 1650136 ◽  
Author(s):  
Ioulia N. Baoulina

We present a simple proof of the well-known fact concerning the number of solutions of diagonal equations over finite fields. In a similar manner, we give an alternative proof of the recent result on generalizations of Carlitz equations. In both cases, the use of character sums is avoided by using an elementary combinatorial argument.


2019 ◽  
Vol 23 (1) ◽  
pp. 183-205
Author(s):  
Oliver Roche-Newton ◽  
Igor E. Shparlinski ◽  
Arne Winterhof
Keyword(s):  

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.


Sign in / Sign up

Export Citation Format

Share Document