有限域上Carlitz方程的解数

设F_q是含有q个元素的有限域,其中q=p~t,t≥1,p是一个奇素数.研究了Carlitz方程的推广形式(a_1x_1~(m_1)+…+a_nx_n~(m_n)+a_(n+1)x_(n+1)~(m_(n+1))+…+a_(n+s)x_(n+s)~(m_(n+s)))~k=bx_1~(k_1)…x_n~(k_n),其中ai,b∈F_q~*,s≥1,n≥1.当方程变量的指数满足一定条件时,得到了方程的解数公式.     

有限域上一类方程的解数公式

本文给出有限域Ｆｑ上一类方程ａ１ｘ１ｄ１１…ｘｎｄ１ｎ＋ａ２ｘ１ｄ２１…ｘｎｄ２ｎ＋…＋ａｓｘ１ｄｓ１…ｘｎｄｓｎ＝ｂ的解数公式，这里ｄｉｊ＞０，ａｉ∈Ｆｑ，ｉ＝１，…，ｓ，ｊ＝１，…，ｎ．特别当ｓ＝ｎ，ｇｃｄ（｜ｄｉｊ｜，ｑ－１）＝１时，得到了简明的解数公式．     

有限域上一类方程解数的直接公式

本文给出有限域F=Fq上一类方程(?)当指数满足一定条件时,在Fn2上解数的一个直接公式,这里dij＞0,ai∈F*,b∈F,q=pf,f≥1,p是一个奇素数,0＜n1 ≤ n2.     

有限域上一类方程解数的直接公式

本文给出有限域F=Fq上一类方程a1xd111…xd1n1n1 … an1xdn111…xdn1n1n1 an1 1xdn1 111…xdn1 1n2n2 … an2x1dn21…xdn2n2n2=b 当指数满足一定条件时,在Fn2上解数的一个直接公式,这里dij>0,ai ∈F*,b ∈F,q=pf,f≥1, p足一个奇素数,0相似文献   

有限域上一类方程组解数的直接公式

本文给出有限域F=F_q(q=p~f,f≥1,p是一个奇素数)上一类方程组∑_(i=s_(r-1)+1~(s_r)∑_(j=1)~(m_i-m_(i-1))a_(m_(i-1)+j)x_1~(d_m(i-1)+j,1)…x_(n_i)~d_(m_(i-1)+j,n_i)=b_r,r=1,…,k当指数满足一定条件时,在F~(n_s_k)上解数的一个直接公式,这里d_(ij)＞0,a_i∈F~*,b_i∈F,0= s_0＜s_1＜…＜s_k,0=m_0＜m_1＜…＜m_(s_k),0=n_0＜n_1＜…＜n_(s_k), m_1≤n_1,…,m_(s_k)≤n_(s_k)．     

有限域上一类方程解数的注记

设Fq是含有q个元素的有限域,其中q=pr,r≥1,p是奇素数.研究了有限域Fq上Markoff-Hurwitz类型方程,并给出了当其增广次数矩阵在剩余类环Z/(q-1)Z中可逆时其解数公式的组合证明方法.进一步研究了其推广形式,并得到了此推广形式的方程在特殊条件下的解数公式.     

一类丢番图方程与有限域上对角方程的解

给出了一类丢番图方程的解数为11,…,18时,其最小整数解的具体表达式,并推广得到该类丢番图方程的解数为素数p时,其最小整数解的具体表达式.还补充了该类丢番图方程的解数为6,8,10时,w的具体值,其中w为有限域F_q上简单对角方程的次数向量d=(d₁,…,d_n)的压缩向量.     

一类素数模对角型同余式的解数

设 p 是奇素数,d 是适合 d>1以及 d|p-1的整数,M_0(d)是1,2,…,p-1中模 p 的 d 次剩余的集合.对于任何适合1≤k≤(p-1)/d 的整数k,本文给出了同余式x_1+…+x_k≡0(modp),x_1<…相似文献   

关于有限域上多项式方程组的解数估计

本给出有限域上多项式方程组零点个数的一个结果,改进了由Ｃｈｅｖａｌｌｅｙ,Ｗａｒｎｉｎｇ,Ａｘ,Ｋａｔｚ古典结果的Ｏ．Ｍｏｒｅｎｏ－Ｃ．Ｊ．Ｍｏｒｅｎｏ最近结果。     

关于Thue方程的解数

设ｍ是正整数，ｆ（Ｘ，Ｙ）＝ａ０Ｘｎ＋ａ１Ｘ（ｎ－１）Ｙ＋．．．＋ａｎＹｎ∈Ｚ［Ｘ，Ｙ］是Ｑ上不可约化的叫ｎ（ｎ≥３）次齐次多项式。本文证明了：当ｇｃｄ（ｍ，ａ０）＝１，ｎ≥４００且ｍ≥１０（３５）时，方程｜ｆ（ｘ，ｙ）｜＝ｍ，ｘ，ｙ∈ｚ，ｇｃｄ（ｘ，ｙ）＝１，至多有６ｎｖ（ｍ）组解（ｘ，ｙ），其中ｖ（ｍ）是同余式Ｆ（ｚ）＝ｆ（ｚ，１）≡０（ｍｏｄｍ）的解数。特别是当ｇｃｄ（ｍ，ＤＦ）＝１时，该方程至多有６ｎ（ω（ｍ）＋１）组解（ｘ，ｙ），其中ＤＦ是多项式Ｆ的判别式，ω（ｍ）是ｍ的不同素因数的个数．     

关于有限域上一类方程解的个数

Let Fq be a finite field with q = pf elements,where p is an odd prime.Let N(a1x12 + ···+anxn2 = bx1 ···xs) denote the number of solutions(x1,...,xn) of the equation a1x12 +···+ anxn2 = bx1 ···xs in Fnq,where n 5,s n,and ai ∈ F*q,b ∈ F*q.In this paper,we solve the problem which the present authors mentioned in an earlier paper,and obtain a reduction formula for the number of solutions of equation a1x21 + ··· + anxn2 = bx1 ···xs,where n 5,3 ≤ s n,under a certain restriction on coefficients.We also obtain an explicit formula for the number of solutions of equation a1x21 + ··· + anxn2 = bx1 ···xn-1 in Fqn under a restriction on n and q.     

Counting Solutions to Equations in Many Variables over Finite Fields

We present a polynomial-time algorithm for computing the zeta function of a smooth projective hypersurface of degree d over a finite field of characteristic p, under the assumption that p is a suitably small odd prime and does not divide d. This improves significantly upon an earlier algorithm of the author and Wan which is only polynomial-time when the dimension is fixed.     

关于有限域上一类方程零点个数的估计

By establishing the connection between graph colouring and the solution of some equation systems in finite fields, we obtain some formulas to the number of solutions of some equation systems in finite fields, in terms of chromatic polynomial of a graph.     

On a class of diagonal equations over finite fields

Using properties of Gauss and Jacobi sums, we derive explicit formulas for the number of solutions to a diagonal equation of the form $x_1^{2^m}+\cdots +x_n^{2^m}=0$ over a finite field of characteristic $p\equiv \pm 3(\mathrm{mod}8)$. All of the evaluations are effected in terms of parameters occurring in quadratic partitions of some powers of p.     

On the number of solutions of some Kummer equations over finite fields

Let l be a prime number and let $k={\mathbb{F}}_q$ be a finite field of characteristic $p\ne l$ with $q=p^f$ elements. Let $n\ge 0$. We determine the number N of solutions $(x,y)$ in k of the Kummer equation$y^l=x(x^{l^n}-1),$ in terms of the trace of a certain Jacobi sum.     

On Explicit Formulas for the Number of Solutions to the Equation (x1+...+xn)2 =ax1...xn in a Finite Field

We consider the equation of the title in a finite field of q elements. Assuming certain relations between n and q, we obtain explicit formulas for the number of solutions to this equation.     

Number of Zeros of Diagonal Polynomials over Finite Fields

Let F be a finite field with q=pf elements, where p is a prime. Let N be the number of solutions (x1,…,xn) of the equation c1xd11+···+cnxdnn=c over the finite fields, where d1∣q−1, ciϵF*(i=1, 2,…,n), and cϵF. In this paper, we prove that if b1 is the least integer such that b1≥∑ni=1 (f/ri) (Di, p−1)/(p−1), then q[b1/f]−1∣N, where ri is the least integer such that di∣pri−1, Didi=pri−1, the (Di, p−1) denotes the greatest common divisor of Di and p−1, [b1/f] denotes the integer part of b1/f. If di=d, then this result is an improvement of the theorem that pb∣N, where b is an integer less than n/d, obtained by J. Ax (1969, Amer. J. Math.86, 255–261) and D. Wan (1988, Proc. AMS103, 1049–1052), under a certain natural restriction on d and n.     

二次高斯和与有限域上方程的解数

设f∈F_q[x_1,…,x_n]是一个n元多项式,其中F_q为q元有限域.用N(f)表示方程f=0在F_q~n中解的个数.寻找N(f)的表达式在有限域研究中具有重要意义.利用二次特征与二次高斯和,给出了有限域上一类方程的解数公式.