Let p stand for an odd prime and let η∈Z+ (the set of positive integers). Let Fq denote the finite field having q=pη elements and F∗q=Fq∖{0}. In this paper, when the determinants of exponent matrices are coprime to q−1, we use the Smith normal form of exponent matrices to derive exact formulas for the numbers of rational points on the affine varieties over Fq defined by
{a1xd111...xd1nn+...+asxds11...xdsnn=b1,as+1xds+1,11...xds+1,nn+...+as+txds+t,11...xds+t,nn=b2
and
{c1xe111...xe1mm+...+crxer11...xermm=l1,cr+1xer+1,11...xer+1,mm+...+cr+kxer+k,11...xer+k,mm=l2,cr+k+1xer+k+1,11...xer+k+1,mm+...+cr+k+wxer+k+w,11...xer+k+w,mm=l3,
respectively, where dij,ei′j′∈Z+,ai,ci′∈F∗q,i=1,...,s+t, j=1,...,n,i′=1,...,r+k+w,j′=1,...,m, and b1,b2,l1,l2,l3∈Fq. These formulas extend the theorems obtained by Q. Sun in 1997. Our results also give a partial answer to an open question posed by S.N. Hu, S.F. Hong and W. Zhao [The number of rational points of a family of hypersurfaces over finite fields, J. Number Theory 156 (2015), 135–153].
Citation: Guangyan Zhu, Shiyuan Qiang, Mao Li. Counting rational points of two classes of algebraic varieties over finite fields[J]. AIMS Mathematics, 2023, 8(12): 30511-30526. doi: 10.3934/math.20231559
[1] | Shuangnian Hu, Yanyan Li, Rongquan Feng . Counting rational points of quartic diagonal hypersurfaces over finite fields. AIMS Mathematics, 2024, 9(1): 2167-2180. doi: 10.3934/math.2024108 |
[2] | Junyong Zhao, Shaofang Hong, Chaoxi Zhu . The number of rational points of certain quartic diagonal hypersurfaces over finite fields. AIMS Mathematics, 2020, 5(3): 2710-2731. doi: 10.3934/math.2020175 |
[3] | Salvador Cruz Rambaud, Blas Torrecillas Jover . An analysis of the algebraic structures in the context of intertemporal choice. AIMS Mathematics, 2022, 7(6): 10315-10343. doi: 10.3934/math.2022575 |
[4] | Yunpeng Xue . On enhanced general linear groups: nilpotent orbits and support variety for Weyl module. AIMS Mathematics, 2023, 8(7): 14997-15007. doi: 10.3934/math.2023765 |
[5] | Lin Han, Guangyan Zhu, Zongbing Lin . On the rationality of generating functions of certain hypersurfaces over finite fields. AIMS Mathematics, 2023, 8(6): 13898-13906. doi: 10.3934/math.2023711 |
[6] | Juxiang Sun, Guoqiang Zhao . Homological conjectures and stable equivalences of Morita type. AIMS Mathematics, 2025, 10(2): 2589-2601. doi: 10.3934/math.2025120 |
[7] | Panpan Jia, Jizhu Nan, Yongsheng Ma . Separating invariants for certain representations of the elementary Abelian $ p $-groups of rank two. AIMS Mathematics, 2024, 9(9): 25603-25618. doi: 10.3934/math.20241250 |
[8] | Kareem T. Elgindy, Hareth M. Refat . A direct integral pseudospectral method for solving a class of infinite-horizon optimal control problems using Gegenbauer polynomials and certain parametric maps. AIMS Mathematics, 2023, 8(2): 3561-3605. doi: 10.3934/math.2023181 |
[9] | Junyong Zhao, Yang Zhao, Yujun Niu . On the number of solutions of two-variable diagonal quartic equations over finite fields. AIMS Mathematics, 2020, 5(4): 2979-2991. doi: 10.3934/math.2020192 |
[10] | Guanghui Zhang, Shuhua Liang . On the construction of constacyclically permutable codes from constacyclic codes. AIMS Mathematics, 2024, 9(5): 12852-12869. doi: 10.3934/math.2024628 |
Let p stand for an odd prime and let η∈Z+ (the set of positive integers). Let Fq denote the finite field having q=pη elements and F∗q=Fq∖{0}. In this paper, when the determinants of exponent matrices are coprime to q−1, we use the Smith normal form of exponent matrices to derive exact formulas for the numbers of rational points on the affine varieties over Fq defined by
{a1xd111...xd1nn+...+asxds11...xdsnn=b1,as+1xds+1,11...xds+1,nn+...+as+txds+t,11...xds+t,nn=b2
and
{c1xe111...xe1mm+...+crxer11...xermm=l1,cr+1xer+1,11...xer+1,mm+...+cr+kxer+k,11...xer+k,mm=l2,cr+k+1xer+k+1,11...xer+k+1,mm+...+cr+k+wxer+k+w,11...xer+k+w,mm=l3,
respectively, where dij,ei′j′∈Z+,ai,ci′∈F∗q,i=1,...,s+t, j=1,...,n,i′=1,...,r+k+w,j′=1,...,m, and b1,b2,l1,l2,l3∈Fq. These formulas extend the theorems obtained by Q. Sun in 1997. Our results also give a partial answer to an open question posed by S.N. Hu, S.F. Hong and W. Zhao [The number of rational points of a family of hypersurfaces over finite fields, J. Number Theory 156 (2015), 135–153].
Throughout this paper, p will always denote an odd prime, Z+ and Fq denote the set of positive integers and the finite field having q=pη elements, respectively, where η∈Z+. Then F∗q:=Fq∖{0} forms a group under the multiplicative operation. For any finite set S, |S| means its cardinality. Let λ,n∈Z+ and ⟨λ⟩ be the set of the first λ positive integers. Let x1,...,xn−1 and xn be n indeterminates in Fq, and for brevity, let x=(x1,...,xn). Let f1(x),...,fλ(x) be the system of n-variable polynomials over Fq, and we denote by V(f1,...,fλ)=V(f1(x),...,fλ(x)) the affine variety determined by the vanishing of these polynomials. Define
N(V)=|{x=(x1,...,xn)∈Fnq:f1(x)=...=fλ(x)=0}|. |
When λ=1, one writes N(V)=N(f). Finding an accurate formula for N(V) is a common and significant subject. However, such a problem is hard in general. In the past 70 years, many mathematicians were devoted to this subject and made much vital progress (see [1,2,3,4,5,6,7,8,9,10,11,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27]).
In 1997, the number N(f) of rational points over Fq on the following affine hypersurface
f=a1xe111...xe1nn+...+asxes11...xesnn−b=0, eij∈Z+,ai∈F∗q,b∈Fq,i∈⟨s⟩,j∈⟨n⟩ |
was investigated by Sun [18]. Besides, the accurate formula for the number N(f) of rational points was found in [18]:
N(f)={qn−(q−1)n+q−1qA(n−1) if b=0,1qA(n) otherwise |
provided s=n and gcd(det(eij),q−1)=1, where A(𝓈):=(q−1)𝓈−(−1)𝓈, ∀𝓈∈Z+. Eight years later, the result of [18] was successfully extended by Wang and Sun [21]. Actually, they attained a formula for the number of (x1,...xn2)∈Fn2q on the following hypersurface
a1xd111...xd1n1n1+...+an1xdn1,11...xdn1,n1n1+an1+1xdn1+1,11...xdn1+1,n2n2+...+an2xdn2,11...xdn2,n2n2=b |
with dij∈Z+,ai∈F∗q,1≤i,j≤n2.
In 2015, Hu, Hong and Zhao [9] gave a uniform generalization to the results of [20,21]. Actually, they used the Smith normal form to deduce an accurate formula for N(f) of (x1,...xnt)∈Fntq on the hypersurface over Fq defined by
f:=f(x1,...,xnt)=t−1∑j=0rj+1−rj∑i=1arj+ixerj+i,11...xerj+i,nj+1nj+1−b, | (1.1) |
where the integers t>0, 0=r0<r1<r2<...<rt, 1≤n1<n2<...<nt, b∈Fq, ai∈F∗q and eij∈Z+, i∈⟨rt⟩, j∈⟨nt⟩. Under some restrictions on f, a little bit simple formula about the number of rational points on the hypersurface (1.1) was given in [13]. One notices that the result of [9] was extended by Hu and Zhao [11] from the hypersurface case to certain algebraic variety case.
An open problem was raised at the end of [9, Section 3]. For the case of the variety consisting of two hypersurfaces, Hu, Qin and Zhao [10] and Zhu and Hong [27] obtained some partial answers to this problem. In other words, Hu, Qin and Zhao [10] gave an explicit formula for N(V(f1,f2)), where
{f1:=r1∑i=1a1ixe(1)i11...xe(1)i,n1n1+r2∑i=r1+1a1ixe(1)i11...xe(1)i,n2n2−b1f2:=r3∑i′=1a2i′xe(2)i′11...xe(2)i,n3n3+r4∑i′=r3+1a2i′xe(2)i′11...xe(2)i′,n4n4−b2 |
with 1≤r1<r2,1≤r3<r4,1≤n1<n2,1≤n3<n4, e(1)i,j, e(2)i′,j′∈Z+, b1,b2∈Fq, and a1i,a2i′∈F∗q, i∈⟨r2⟩, i′∈⟨r4⟩, j∈⟨n2⟩, j′∈⟨n4⟩. Zhu and Hong [27] used and developed the techniques in [9] to get an exact formula for the number of rational points on V=V(f1,f2) over Fq with
{f1:=f1(x1,...,xnt)=r∑i=1a(1)ixe(1)i11...xe(1)inn−b1,f2:=f2(x1,...,xnt)=t−1∑j′=0rj′+1−rj′∑i′=1a(2)rj′+i′xe(2)rj′+i′,11...xe(2)rj′+i′,nj′+1nj′+1−b2, | (1.2) |
where bi∈Fq,i=1,2, t∈Z+, 0=n0<n1<n2<...<nt, nk−1<n≤nk for some k∈⟨t⟩, 0=r0<r1<r2<...<rt, a(1)i,a(2)i′∈F∗q,i∈⟨r⟩,i′∈⟨rt⟩, e(1)i,j, e(2)i′,j′∈Z+, j∈⟨n⟩, j′∈⟨nt⟩.
Inspired by the works of [9,18,21,27], we consider in this paper the question of counting rational points on the variety V(f1,f2) with
{f1:=a1xd111...xd1nn+...+asxds11...xdsnn−b1,f2:=as+1xds+1,11...xds+1,nn+...+as+txds+t,11...xds+t,nn−b2, | (1.3) |
and the variety V(f1,f2,f3) with
{f1:=c1xe111...xe1mm+...+crxer11...xermm−l1,f2:=cr+1xer+1,11...xer+1,mm+...+cr+kxer+k,11...xer+k,mm−l2,f3:=cr+k+1xer+k+1,11...xer+k+1,mm+...+cr+k+wxer+k+w,11...xer+k+w,mm−l3, | (1.4) |
where dij,ei′j′∈Z+,ai,ci′∈F∗q,i∈⟨s+t⟩,j∈⟨n⟩,i′∈⟨r+k+w⟩,j′∈⟨m⟩, and b1,b2,l1,l2,l3∈Fq. Let
E1=(d11d12⋯d1n⋮⋮⋮ds1ds2⋯dsnds+1,1ds+1,2⋯ds+1,n⋮⋮⋮ds+t,1ds+t,2⋯ds+t,n) | (1.5) |
with dij,i∈⟨s+t⟩,j∈⟨n⟩ being given as in (1.3), and let
E2=(e11e12⋯e1m⋮⋮⋮er1er2⋯ermer+1,1er+1,2⋯er+1,m⋮⋮⋮er+k,1er+k,2⋯er+k,mer+k+1,1er+k+1,2⋯er+k+1,m⋮⋮⋮er+k+w,1er+k+w,2⋯er+k+w,m) | (1.6) |
with ei′j′,i′∈⟨r+k+w⟩,j′∈⟨m⟩ being given as in (1.4).
From [12], it guarantees the existences of unimodular matrices U2 and V2 with the property
U2E2V2=(D2000), | (1.7) |
where
D2:=diag(g(E2)1,...,g(E2)v′) |
with g(E2)1,...,g(E2)v′∈Z+ and g(E2)1|...|g(E2)v′. The diagonal matrix on the right side of (1.7) is called Smith normal form of E2, and abbreviated as SNF(E2). That is,
SNF(E2)=(D2000). |
Fix α∈F∗q as a primitive element of Fq, then for any β∈F∗q, one can find a unique integer γ∈[1,q−1] with β=αγ, and such an integer γ is said to be the index of β on the basis α. We write indαβ:=γ.
Consider the variety defined by
{r∑i=1ci𝓋i=l1,r+k∑i=r+1ci𝓋i=l2,r+k+w∑i=r+k+1ci𝓋i=l3, | (1.8) |
where ci′,l1,l2,l3,i′∈⟨r+k+w⟩ are given as in (1.4). Let N denote the number of rational points (𝓋1,...,𝓋r+k+w)∈(F∗q)r+k+w on (1.8) satisfying
{gcd(q−1,g(E2)j)|h(E2)j for j∈⟨v′⟩(q−1)|h(E2)j for j∈⟨r+k+w⟩∖⟨v′⟩, | (1.9) |
where
(h(E2)1,...,h(E2)r+k+w)T:=U2(indα(𝓋1),...,indα(𝓋r+k+w))T. |
We can now state our main results.
Theorem 1.1. Let V be the variety defined by (1.3). If s+t=n and gcd(q−1,det(E1))=1, then
N(V)={qn−(q−1)n+(q−1)2q2A(s−1)A(t−1)if b1=b2=0,q−1q2A(s)A(t−1)if b1≠0,b2=0,q−1q2A(s−1)A(t)if b1=0,b2≠0,1q2A(s)A(t)if b1≠0,b2≠0. | (1.10) |
Theorem 1.2. Let V be the variety defined by (1.4). Then
N(V)={qm−(q−1)m+NRif l1=l2=l3=0,NRotherwise, | (1.11) |
where R:=(q−1)m−v′v′∏j=1gcd(q−1,g(E2)j).
From Theorem 1.2, one can derive the third main result of this paper as follows.
Theorem 1.3. Let V denote the affine variety defined by (1.4). If r+k+w=m and gcd(q−1,det(E2))=1, then
N(V)={qm−(q−1)m+(q−1)3q3A(r−1)A(k−1)A(w−1)if ll=l2=l3=0,(q−1)2q3A(r−1)A(k−1)A(w)if ll=l2=0,l3≠0,(q−1)2q3A(r−1)A(k)A(w−1)if ll=l3=0,l2≠0,(q−1)2q3A(r)A(k−1)A(w−1)if l1≠0,l2=l3=0,q−1q3A(r)A(k)A(w−1)if ll≠0,l2≠0,l3=0,q−1q3A(r)A(k−1)A(w)if ll≠0,l2=0,l3≠0,q−1q3A(r−1)A(k)A(w)if l1=0,l2≠0,l3≠0,1q3A(r)A(k)A(w)if l1≠0,l2≠0,l3≠0. | (1.12) |
Obviously, Theorems 1.1 to 1.3 also give a partial answer to the open problem proposed at the end of [9, Section 3].
In Section 2, in order to prove Theorems 1.1 to 1.3, we give several auxiliary results. Then in Section 3, one presents the details of the proofs of Theorems 1.1 to 1.3. Finally, four examples are provided in Section 4.
In this section, we present several preliminary results which are needed in the proofs of Theorems 1.1 to 1.3. We begin with a result due to Zhu and Hong [27].
Lemma 2.1. [27, Lemma 2.6] Let cij∈F∗q, i∈⟨𝓂⟩, j∈⟨𝓀i⟩, c1,...,c𝓂∈Fq. Let N(c1,...,c𝓂) stand for the number of (u11,...,u1𝓀1,...,u𝓂1,...,u𝓂𝓀𝓂)∈(F∗q)𝓀1+...+𝓀𝓂 such that
{c11u11+...+c1𝓀1u1𝓀1=c1⋮c𝓂1u𝓂1+...+c𝓂𝓀𝓂u𝓂𝓀𝓂=c𝓂. |
Then
N(c1,...,c𝓂)=(q−1)|{1≤i≤m:ci=0}|qmm∏i=1ci=0A(𝓀i−1)m∏i=1ci≠0A(𝓀i). |
Lemma 2.2. Let ai∈F∗q, i∈⟨s+t⟩, b1,b2∈Fq. Let N(b1,b2) denote the number of (𝓊1,...,𝓊s+t)∈(F∗q)s+t with
{s∑i=1ai𝓊i=b1,s+t∑i=s+1ai𝓊i=b2. | (2.1) |
Then
N(b1,b2)={(q−1)2q2A(s−1)A(t−1)if b1=b2=0,q−1q2A(s)A(t−1)if b1≠0,b2=0,q−1q2A(s−1)A(t)if b1=0,b2≠0,1q2A(s)A(t)if b1≠0,b2≠0. | (2.2) |
Proof. The result follows immediately from Lemma 2.1.
Lemma 2.3. Let ci∈F∗q for all i∈⟨r+k+w⟩ and let l1,l2,l3∈Fq. Let N(l1,l2,l3) denote the number of (𝓋1,...,𝓋r+k+w)∈(F∗q)r+k+w satisfying (1.8). Then
N(l1,l2,l3)={(q−1)3q3A(r−1)A(k−1)A(w−1)if ll=l2=l3=0,(q−1)2q3A(r−1)A(k−1)A(w)if ll=l2=0,l3≠0,(q−1)2q3A(r−1)A(k)A(w−1)if ll=l3=0,l2≠0,(q−1)2q3A(r)A(k−1)A(w−1)if l1≠0,l2=l3=0,q−1q3A(r)A(k)A(w−1)if ll≠0,l2≠0,l3=0,q−1q3A(r)A(k−1)A(w)if ll≠0,l2=0,l3≠0,q−1q3A(r−1)A(k)A(w)if l1=0,l2≠0,l3≠0,1q3A(r)A(k)A(w)if l1≠0,l2≠0,l3≠0. | (2.3) |
Proof. This follows immediately from Lemma 2.1.
Reference [12] tells us that by using elementary transformation, we can readily find unimodular matrices U1 and V1 with the property
U1E1V1=(D1000), | (2.4) |
where E1 is given as in (1.5),
D1:=diag(g(E1)1,...,g(E1)v) |
with g(E1)1,...,g(E1)v∈Z+ and g(E1)1|...|g(E1)v. Let M represent the number of (𝓊1,...,𝓊s+t)∈(F∗q)s+t on (2.1) under the following additional restrictions:
{gcd(q−1,g(E1)j)|h(E1)j for j∈⟨v⟩(q−1)|h(E1)j for j∈⟨s+t⟩∖⟨v⟩, | (2.5) |
where
(h(E1)1,...,h(E1)s+t)T:=U1(indα(𝓊1),...,indα(𝓊s+t))T. |
As a special case of [27, Theorem 1.2], one has the following result.
Lemma 2.4. Let V be the variety (1.3). Then
N(V)={qn−(q−1)n+M(q−1)n−vv∏j=1gcd(q−1,g(E1)j)if b1=b2=0,M(q−1)n−vv∏j=1gcd(q−1,g(E1)j)otherwise. |
Let gij,𝒷i(i∈⟨𝓁⟩,j∈⟨𝓊⟩) and 𝒶 be integers. Let Y=(y1,...,y𝓊)T and B=(𝒷1,...,𝒷𝓁)T. Then one forms an 𝓁×𝓊 matrix G=(gij) and the following system of congruences:
GY≡B(mod𝒶). | (2.6) |
From [12], one can use elementary transformation of matrices to find unimodular matrices U and V with the property
UGV=SNF(G)=(D000), |
where D:=diag(d1,...,dτ) with di∈Z+,i∈⟨τ⟩ and di|di+1,i∈⟨τ−1⟩.
Lemma 2.5. [9, Lemma 2.3] Let B′=(𝒷′1,...,𝒷′𝓁)T=UB, then a necessary and sufficient condition for the system (2.6) of linear congruences to have a solution is gcd(𝒶,di)|𝒷′i for all i∈⟨τ⟩ and 𝒶|𝒷′i for all i∈⟨𝓁⟩∖⟨τ⟩. In addition, the number of solutions (y1,...,y𝓊)T of (2.6) equals 𝒶𝓊−ττ∏i=1gcd(𝒶,di).
Lemma 2.6. Let r,k and w be positive integers. Then
∑(𝓋1,...,𝓋r+k+w)∈(F∗q)r+k+w(1.8) holds|{(x1,...,xm)∈(F∗q)m:xei11...xeimm=𝓋i,i∈⟨r+k+w⟩}|=N(q−1)m−v′v′∏j=1gcd(q−1,g(E2)j). | (2.7) |
Proof. First of all, for any given (𝓋1,...,𝓋r+k+w)∈(F∗q)r+k+w satisfying (1.8), we have the system of congruences:
m∑j=1eijindα(xi)≡indα(𝓋i)(modq−1),i∈⟨r+k+w⟩, | (2.8) |
then
|{(x1,...,xm)∈(F∗q)m:xei11...xeimm=𝓋i, i∈⟨r+k+m⟩}|=|{(x1,...,xm)∈(F∗q)m:α∑mj=1eijindα(xi)=αindα(𝓋i), i∈⟨r+k+m⟩}|=|{(x1,...,xm)∈(F∗q)m:(2.8) holds}|. |
However, Lemma 2.5 tells us that the necessary and sufficient condition for (2.8) to have a solution is that (1.9) holds. In addition, if (2.8) has a solution, then the number of the m-tuples (indα(x1),...,indα(xm))∈⟨q−1⟩m satisfying (2.8) is equal to
(q−1)m−v′v′∏j=1gcd(q−1,g(E2)j). |
Namely, if (1.9) is satisfied, then
|{(x1,...,xm)∈(F∗q)m:xei11...xeimm=𝓋i,i∈⟨r+k+w⟩}|=(q−1)m−v′v′∏j=1gcd(q−1,g(E2)j). |
Thus, the left hand side of (2.7) is equal to
((q−1)m−v′v′∏j=1gcd(q−1,g(E2)j))×∑(𝓋1,...,𝓋r+k+w)∈(F∗q)r+k+w(1.8) and (1.9) hold1. | (2.9) |
However,
N=∑(𝓋1,...,𝓋r+k+w)∈(F∗q)r+k+w such that (1.8) and (1.9) hold1. | (2.10) |
Hence putting (2.10) into (2.9) gives us the wanted result (2.7).
In this section, we present the proofs of Theorems 1.1 to 1.3. We begin with the proof of Theorem 1.1.
Proof of Theorem 1.1. Taking determinants on both sides of (2.4), we can deduce that
det(U1)det(E1)det(V1)=g(E1)1...g(E1)n. |
Since det(U1)=±1 and det(V1)=±1, the condition
gcd(q−1,det(E1))=1 |
implies that
gcd(q−1,g(E1)j)=1 for all j∈⟨n⟩. |
So (2.5) holds.
Further, by Lemma 2.2, one has
M=∑(𝓊1,...,𝓊s+t)∈(F∗q)s+t such that (2.1) and (2.5) hold1=N(b1,b2) | (3.1) |
with N(b1,b2) being given as in (2.2). It follows from Lemma 2.4 that
N(V)={qn−(q−1)n+Mif b1=b2=0,Motherwise. | (3.2) |
Thus, putting (3.1) and (3.2) together gives the expected result (1.10).
This completes the proof of Theorem 1.1.
Proof of Theorem 1.2. It is clear that
N(V)=∑(𝓋1,...,𝓋r+k+w)∈(Fq)r+k+w(1.8) holds|{(x1,...,xm)∈Fmq:xei11...xeimm=𝓋i,i∈⟨r+k+w⟩}|. | (3.3) |
One defines the set T(l1,l2,l3) of Fq-rational points as follows:
T(l1,l2,l3):={(𝓋1,...,𝓋r+k+w)∈Fr+k+wq:(1.8) holds}. | (3.4) |
Substituting (3.4) into (3.3) yields
N(V)=∑(𝓋1,...,𝓋r+k+w)∈T(l1,l2,l3)|{(x1,...,xm)∈Fmq:xei11...xeimm=𝓋i,i∈⟨r+k+w⟩}|. | (3.5) |
Define the set T(0) by T(0):=∅ if l1,l2 and l3 are not all zero, and if l1=l2=l3=0, then T(0) consists of the zero vector of dimension r+k+w. For any integer ρ with 1≤ρ≤r+k+w, one defines the set T(ρ) to be the subset of T(l1,l2,l3) consisting of (𝓋1,...,𝓋r+k+w)∈Fr+k+wq with exactly ρ nonzero components. Noticing that 𝓋1,...,𝓋r+k+w are simultaneously zero, or simultaneously nonzero, one has T(ρ)=∅ when 0<ρ<r+k+w. Hence,
T(l1,l2,l3)=r+k+w⋃ρ=0T(ρ)=T(0)∪T(r+k+w). | (3.6) |
Now, applying Lemma 2.6, we have
∑(𝓋1,...,𝓋r+k+w)∈T(r+k+w)|{(x1,...,xm)∈Fmq:xei11...xeimm=𝓋i,i∈⟨r+k+w⟩}|=∑(𝓋1,...,𝓋r+k+w)∈(F∗q)r+k+w(1.8) holds|{(x1,...,xm)∈Fmq:xei11...xeimm=𝓋i,i∈⟨r+k+w⟩}|=∑(𝓋1,...,𝓋r+k+w)∈(F∗q)r+k+w(1.8) holds|{(x1,...,xm)∈(F∗q)m:xei11...xeimm=𝓋i,i∈⟨r+k+w⟩}|(since (𝓋1,...,𝓋r+k+w)∈(F∗q)r+k+w implying (x1,...,xm)∈(F∗q)m)=N(q−1)m−v′v′∏j=1gcd(q−1,g(E2)j). | (3.7) |
It readily follows that if at least one of l1,l2 and l3 is nonzero, then T(0)=∅, and so by (3.5) to (3.7), one has
N(V)=∑(𝓋1,...,𝓋r+k+w)∈T(0)∪T(r+k+w)|{(x1,...,xm)∈Fmq:xei11...xeimm=𝓋i,i∈⟨r+k+w⟩}|=∑(𝓋1,...,𝓋r+k+w)∈T(r+k+w)|{(x1,...,xm)∈Fmq:xei11...xeimm=𝓋i,i∈⟨r+k+w⟩}|=N(q−1)m−v′v′∏j=1gcd(q−1,g(E2)j). |
If l1=l2=l3=0, then by using (3.5) to (3.7), we derive that
N(V)=∑(𝓋1,...,𝓋r+k+w)∈T(0)∪T(r+k+w)|{(x1,...,xm)∈Fmq:xei11...xeimm=𝓋i,i∈⟨r+k+w⟩}|=∑(𝓋1,...,𝓋r+k+w)∈T(0)|{(x1,...,xm)∈Fmq:xei11...xeimm=𝓋i,i∈⟨r+k+w⟩}| +∑(𝓋1,...,𝓋r+k+w)∈T(r+k+w)|{(x1,...,xm)∈Fmq:xei11...xeimm=𝓋i,i∈⟨r+k+w⟩}|=|{(x1,...,xm)∈Fmq:xei11...xeimm=0,i∈⟨r+k+w⟩}| +N(q−1)m−v′v′∏i=1gcd(q−1,g(E2)i)=|{(x1,...,xm)∈Fmq:xe111...xe1mm=0}|+N(q−1)m−v′v′∏i=1gcd(q−1,g(E2)i)=|{(x1,...,xm)∈Fmq:x1...xm=0}|+N(q−1)m−v′v′∏i=1gcd(q−1,g(E2)i)=m∑j=1(mj)(q−1)m−j+N(q−1)m−v′v′∏i=1gcd(q−1,g(E2)i)=qm−(q−1)m+N(q−1)m−v′v′∏i=1gcd(q−1,g(E2)i) |
as expected.
This finishes the proof of Theorem 1.2.
Proof of Theorem 1.3. Taking determinants on both sides of (1.7), one has
det(U2)det(E2)det(V2)=g(E2)1...g(E2)m. |
Because det(U2)=±1 and det(V2)=±1, the condition gcd(q−1,det(E2))=1 guarantees that
gcd(q−1,g(E2)i)=1 for all i∈⟨m⟩. |
This ensures that (1.9) is satisfied.
Noting that
N=∑(𝓋1,...,𝓋r+k+w)∈(F∗q)r+k+w such that (1.8) and (1.9) hold1=N(l1,l2,l3) | (3.8) |
with N(l1,l2,l3) being given as in (2.3), it follows from (1.11) that
N(V)={qm−(q−1)m+Nif l1=l2=l3,Notherwise. | (3.9) |
Therefore, by the identities (3.8) and (3.9), the desired result (1.12) follows immediately.
This concludes the proof of Theorem 1.3.
In this section, we give four examples to demonstrate the validity of Theorems 1.1 to 1.3.
Example 4.1. We calculate the number N(V) of rational points on the variety
{f1(x1,...,x5)=x1x22x33x44x55+x21x22x43x54x5−2=0,f2(x1,...,x5)=x31x42x23x34x5+x21x52x43x24x25+x21x32x3x24x25=0 |
over F11.
Clearly, we have
b1=2,b2=0,q=11,q−1=10,s=2,t=3,n=5, |
and
E1=(1234522451342312542223122). |
Since det(E1)=9, one derives that gcd(q−1,det(E1))=1. By Theorem 1.1, we can calculate and obtain that
N(V)=1112((11−1)2−(−1)2)((11−1)3+(−1)3⋅(11−1))=810. |
Example 4.2. We compute the number N(V) of rational points on the variety
{f1(x1,...,x6)=x1x22x33x44x55x6+x21x22x43x54x5x6=1,f2(x1,...,x6)=x31x42x23x34x5x26+x21x52x43x24x25x6=2,f3(x1,...,x6)=x1x22x3x24x35x6+x21x32x3x24x25x6=0 | (4.1) |
over F7.
Evidently, we have
l1=l2=l3=0,q=7,m=6,r=k=w=2 |
and
E2=(123451224511342312254221121231231221). |
Hence, det(E2)=−22, one observes that gcd(q−1,det(E2))≠1.
By using Maple, we can find two unimodular matrices
U2=(11−50−7103−618−19−265−616−13−21−56−151−2194−513−13−177−1028−29−38) |
and
V2=(10000501000−1500100−12000101100001−10000001) |
such that
U2E2V2=SNF(E2)=(1000000100000010000001000000100000022). |
Thus,
g(E2)1=g(E2)2=g(E2)3=g(E2)4=g(E2)5=1,g(E2)6=22 and v′=6. |
Still using Maple, we compute and get that the number N of vectors (𝓋1,...,𝓋6)∈(F∗q)6 with
{𝓋1+𝓋2=0𝓋3+𝓋4=0𝓋5+𝓋6=0 |
under the extra restriction (1.9) is equal to 108. Thus, by Theorem 1.2, we have
N(V)=76−66+108×2=71209. |
Example 4.3. We compute the number N(V) of rational points on the variety
{f1(x1,...,x6)=x1x22x33x44x55x46+x111x52x43x54x5x46=0,f2(x1,...,x6)=x31x42x23x34x5x36+x71x32x53x24x5x46=0,f3(x1,...,x6)=x21x62x33x24x25x36+x81x22x113x54x35x56=0 |
over F13.
Obviously, we have
l1=l2=l3=0,q=13,q−1=12,m=6,r=k=w=2 |
and
E2=(12345411545143423137352142632238211535). |
Since det(E2)=4387=41×107, we deduce that gcd(q−1,det(E2))=1. By Theorem 1.3, we compute and obtain that
N(V)=136−126+1133(122+12)(122+12)(122+12)=1842553. |
Example 4.4. We calculate the number N(V) of rational points on the variety
{f1(x1,...,x7)=x1x22x33x44x55x46x57+x21x52x43x54x5x46x47−2=0,f2(x1,...,x7)=x31x42x23x34x5x36x27+x21x32x53x24x5x46x57+x21x62x33x24x25x36x57=0,f3(x1,...,x7)=x21x22x33x34x55x36x37+x21x22x43x54x35x56x37=0 |
over F11.
It is clear that
l1=2,l2=l3=0,q=11,q−1=10,m=7,r=2,k=3,w=2 |
and
E2=(1234545254514434231322352145263223522335332245353). |
Thus, det(E2)=957 which infers that gcd(q−1,det(E2))=1. Therefore, by employing Theorem 1.3, we compute and obtain that
N(V)=1113((11−1)2−(−1)2)((11−1)3+(−1)3(11−1))((11−1)2+(−1)2(11−1))=8100. |
The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.
The research of M. Li was supported partially by National Science Foundation of China (Grant No. 12071375).
The authors declare that there is no conflict of interest in this paper.
[1] |
J. Ax, Zeros of polynomials over finite fields, Amer. J. Math., 86 (1964), 255–261. https://doi.org/10.2307/2373163 doi: 10.2307/2373163
![]() |
[2] |
W. Cao, Q. Sun, A reduction for counting the number of zeros of general diagonal equation over finite fields, Finite Fields Appl. 12 (2006), 681–692. https://doi.org/10.1016/j.ffa.2005.07.001 doi: 10.1016/j.ffa.2005.07.001
![]() |
[3] |
W. Cao, Q. Sun, On a class of equations with special degrees over finite fields, Acta Arith., 130 (2007), 195–202. https://doi.org/10.4064/aa130-2-8 doi: 10.4064/aa130-2-8
![]() |
[4] |
L. Carlitz, Pairs of quadratic equations in a finite field, Amer. J. Math., 76 (1954), 137–154. https://doi.org/10.2307/2372405 doi: 10.2307/2372405
![]() |
[5] |
S. Chowla, J. Cowles, M. Cowles, On the number of zeros of diagonal cubic forms, J. Number Theory, 9 (1977), 502–506. https://doi.org/10.1016/0022-314X(77)90010-5 doi: 10.1016/0022-314X(77)90010-5
![]() |
[6] |
Y. L. Feng, S. F. Hong, Improvements of p-adic estimates of exponential sums, Proc. Amer. Math. Soc., 150 (2022), 3687–3698. https://doi.org/10.1090/proc/15995 doi: 10.1090/proc/15995
![]() |
[7] |
S. F. Hong, L-functions of twisted diagonal exponential sums over finite fields, Proc. Amer. Math. Soc., 135 (2007), 3099–3108. https://doi.org/10.1090/s0002-9939-07-08873-9 doi: 10.1090/s0002-9939-07-08873-9
![]() |
[8] |
S. F. Hong, C. X. Zhu, On the number of zeros of diagonal cubic forms over finite fields, Forum Math., 33 (2021), 697–708. https://doi.org/10.1515/forum-2020-0354 doi: 10.1515/forum-2020-0354
![]() |
[9] |
S. N. Hu, S. F. Hong, W. Zhao, The number of rational points of a family of hypersurfaces over finite fields, J. Number Theory, 156 (2015), 135–153. https://doi.org/10.1016/j.jnt.2015.04.006 doi: 10.1016/j.jnt.2015.04.006
![]() |
[10] |
S. N. Hu, X. E. Qin, J. Y. Zhao, Counting rational points of an algebraic variety over finite fields, Results Math., 74 (2019), 37. https://doi.org/10.1007/s00025-019-0962-6 doi: 10.1007/s00025-019-0962-6
![]() |
[11] |
S. N. Hu, J. Y. Zhao, The number of rational points of a family of algebraic variety over finite fields, Algebra Colloq., 24 (2017), 705–720. https://doi.org/10.1142/S1005386717000475 doi: 10.1142/S1005386717000475
![]() |
[12] | L. K. Hua, Introduction to Number Theory, Springer-Verlag, Berlin-Heidelberg, 1982. https://mathscinet.ams.org/mathscinet/article?mr = 665428 |
[13] |
H. Huang, W. Gao, W. Cao, Remarks on the number of rational points on a class of hypersurfaces over finite fields, Algebra Colloq., 25 (2018), 533–540. https://doi.org/10.1142/S1005386718000366 doi: 10.1142/S1005386718000366
![]() |
[14] |
L. K. Hua, H. S. Vandiver, Characters over certain types of rings with applications to the theory of equations in a finite field, Proc. Nat. Acad. Sci., 35 (1949), 94–99. https://doi.org/10.1073/pnas.35.2.94 doi: 10.1073/pnas.35.2.94
![]() |
[15] |
G. Myerson, On the number of zeros of diagonal cubic forms, J. Number Theory, 11 (1979), 95–99. https://doi.org/10.1016/0022-314X(79)90023-4 doi: 10.1016/0022-314X(79)90023-4
![]() |
[16] |
D. R. Richman, Some remarks on the number of solutions to the equation f(x1)+...+f(xn)=0, Stud. Appl. Math., 71 (1984), 263–266. https://doi.org/10.1002/sapm1984713263 doi: 10.1002/sapm1984713263
![]() |
[17] |
Q. Sun, On diagonal equations over finite fields, Finite Fields Appl., 3 (1997), 175–179. https://doi.org/10.1006/ffta.1996.0173 doi: 10.1006/ffta.1996.0173
![]() |
[18] | Q. Sun, On the formula of the number of solutions of some equations over finite fields, Chinese Ann. Math. Ser. A, 18 (1997), 403–408. |
[19] |
D. Q. Wan, Zeros of diagonal equations over finite fields, Proc. Amer. Math. Soc., 103 (1988), 1049–1052. https://doi.org/10.1090/s0002-9939-1988-0954981-2 doi: 10.1090/s0002-9939-1988-0954981-2
![]() |
[20] |
W. S. Wang, Q. Sun, The number of solutions of certain equations over a finite field, Finite Fields Appl., 11 (2005), 182–192. https://doi.org/10.1016/j.ffa.2004.06.004 doi: 10.1016/j.ffa.2004.06.004
![]() |
[21] | W. S. Wang, Q. Sun, An explicit formula of solution of some special equations over a finite field, Chinese Ann. Math. Ser. A, 26 (2005), 391–396. |
[22] |
A. Weil, On some exponential sums, Proc. Natl. Acad. Sci. USA, 34 (1948), 204–207. https://doi.org/10.1073/pnas.34.5.204 doi: 10.1073/pnas.34.5.204
![]() |
[23] |
J. Wolfmann, The number of solutions of certain diagonal equations over finite fields, J. Number Theory, 42 (1992), 247–257. https://doi.org/10.1016/0022-314X(92)90091-3 doi: 10.1016/0022-314X(92)90091-3
![]() |
[24] | J. Wolfmann, New results on diagonal equations over finite fields from cyclic codes, in: Finite Fields: Theory, Applications, and Algorithms (Las Vegas, NV, 1993), Contemp. Math., 168, Amer. Math. Soc., Providence, RI, (1994), 387–395. https://dx.doi.org/10.1090/conm/168 |
[25] |
J. Y. Zhao, Y. L. Feng, S. F. Hong, C. X. Zhu, On the number of zeros of diagonal quartic forms over finite fields, Forum Math., 34 (2022), 385–405. https://doi.org/10.1515/forum-2021-0196 doi: 10.1515/forum-2021-0196
![]() |
[26] |
C. X. Zhu, Y. L. Feng, S. F. Hong, J. Y. Zhao, On the number of zeros to the equation f(x1)+...+f(xn)=a over finite fields, Finite Fields Appl., 78 (2021), 101922. https://doi.org/10.1016/j.ffa.2021.101922 doi: 10.1016/j.ffa.2021.101922
![]() |
[27] |
G. Y. Zhu, S. A. Hong, On the number of rational points of certain algebraic varieties over finite fields, Forum Math., 35 (2023), 1511–1532. https://doi.org/10.1515/forum-2022-0324 doi: 10.1515/forum-2022-0324
![]() |