Let Ms, be the number of solutions of the equation X13+ X23+ … + Xs3=0 in the finite field GF(p). For a prime p ≡ 1(mod 3), ∑∞s=1 MsX3 = (x/1-px)+((x2(p-1)(2+dx))/(1-3px2-pdx3)), M3= p2 + d(p - 1), and M4 = p2 + 6(p2 − p). Here d is uniquely determined by 4p = d2 + 27b2 and d ≡ 1(mod 3)
Let s be a positive integer, p be an odd prime, q=ps, and let Fq be a finite field of q elements. Le...
AbstractIn this paper, we give a reduction theorem for the number of solutions of any diagonal equat...
AbstractWe prove that every cubic form in 16 variables over an algebraic number field represents zer...
AbstractLet Ms, be the number of solutions of the equation X13 + X23+ … + Xs3=0 in the finite field ...
Let M<SUB>s</SUB>, be the number of solutions of the equation X<SUB>1</SUB><SUP>3</SUP>+ X<SUB>2</SU...
AbstractWe extend to finite fields in general the results proved, in a recent paper (J. Number Theor...
AbstractLet F be a finite field with q=pf elements, where p is a prime. Let N be the number of solut...
AbstractLet F be a finite field with q=pf elements, where p is a prime number. Let N(n) be the numbe...
AbstractLet α,β∈Fqt∗ and let Nt(α,β) denote the number of solutions (x,y)∈Fqt∗×Fqt∗ of the equation ...
AbstractWe provide an efficient reduction for counting the number of zeros of the so-called general ...
AbstractLet N be the number of solutions of the equationx1m1+⋯+xnmn=ax1⋯xn over the finite field Fq=...
AbstractWe shall establish for all finite fields GF(pn) the following result of Chowla: given a posi...
We use the Hardy-Littlewood circle method, in the form developed by Heath-Brown in 1996, to investig...
We use the Hardy-Littlewood circle method, in the form developed by Heath-Brown in 1996, to investig...
AbstractLet f be a polynomial over finite field Fq with q elements and let N(f=0) denote the number ...
Let s be a positive integer, p be an odd prime, q=ps, and let Fq be a finite field of q elements. Le...
AbstractIn this paper, we give a reduction theorem for the number of solutions of any diagonal equat...
AbstractWe prove that every cubic form in 16 variables over an algebraic number field represents zer...
AbstractLet Ms, be the number of solutions of the equation X13 + X23+ … + Xs3=0 in the finite field ...
Let M<SUB>s</SUB>, be the number of solutions of the equation X<SUB>1</SUB><SUP>3</SUP>+ X<SUB>2</SU...
AbstractWe extend to finite fields in general the results proved, in a recent paper (J. Number Theor...
AbstractLet F be a finite field with q=pf elements, where p is a prime. Let N be the number of solut...
AbstractLet F be a finite field with q=pf elements, where p is a prime number. Let N(n) be the numbe...
AbstractLet α,β∈Fqt∗ and let Nt(α,β) denote the number of solutions (x,y)∈Fqt∗×Fqt∗ of the equation ...
AbstractWe provide an efficient reduction for counting the number of zeros of the so-called general ...
AbstractLet N be the number of solutions of the equationx1m1+⋯+xnmn=ax1⋯xn over the finite field Fq=...
AbstractWe shall establish for all finite fields GF(pn) the following result of Chowla: given a posi...
We use the Hardy-Littlewood circle method, in the form developed by Heath-Brown in 1996, to investig...
We use the Hardy-Littlewood circle method, in the form developed by Heath-Brown in 1996, to investig...
AbstractLet f be a polynomial over finite field Fq with q elements and let N(f=0) denote the number ...
Let s be a positive integer, p be an odd prime, q=ps, and let Fq be a finite field of q elements. Le...
AbstractIn this paper, we give a reduction theorem for the number of solutions of any diagonal equat...
AbstractWe prove that every cubic form in 16 variables over an algebraic number field represents zer...