有限域上一类多项式组的正交性

研究了有限域上一类特殊的多项式组,通过特征和给出了若干判定其正交性的充分条件,从而可以用来构建这种类型的正交多项式组.     

有限域上的多项式和原根

设 f(x),g(x)为有限域 F_q 上的多项式.利用 Weil 关于特征和的定理,我们证明了当 q 足够大时,F_q 有元素ξ使 f(ξ),g(ξ)同时为 F_q 的原根.特别,我们得到了某些二元二次方程 f(x,y)=0有原根解.     

有限域上一类新的置换多项式

由于有限域上的置换多项式在密码、编码和组合设计有着重要的应用,置换多项式是人们比较感兴趣的一个研究课题.利用线性化多项式,得到了一类新的形如(x~(p~k)-x+δ)~s+L(x)的置换多项式.     

有限域上具有交换图表性质的多项式

本文给出了有限域Ｆ_ｑ上满足条件ｆ（ｇ（ｘ））≡ｈ（ｆ（ｘ））的多项式ｆ（ｘ）的通解表示公式及在ｄｅｇｆ＜ｑ条件下的ｆ（ｘ）的个数计算公式，此地ｇ（ｘ）和ｈ（ｘ）是Ｆ_ｑ上给定的两个多项式，其中之一是置换多项式．这一结果推广了文献［３］的主要结果，而在ｇ（ｘ）和ｈ（ｘ）均为线性多项式的特殊情况，则分别推广了文献［１］和［２］中的主要结果．     

有限域上的二次本原多项式

本文证明了对任给定的 a∈GF(q)~*,均存在 GF(q)上的形为 x~2+ax+b的二次本原多项式.从而证明了 Golomb 猜想(D).     

有限域上代数簇间多项式映射的一个注记

设有限域Fq,文献[1]构造性的证明了结论:Map(Fnq,Fq)中的每个元素都可以唯一的表示成Fq[x1,…,xn]中次数不超过q-1的多项式.本文利用Groebner基与多项式映射的相关结论,首先给出了该结论一个更为简明的证明,并进一步得到有限域上代数簇的多项式映射之间一个更为一般的性质.     

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

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

有限域上本原多项式系数的研究

设Fq表示有q个元素的有限域,q为素数的方幂,f(x)=xn+a1xn-1+…+an-1x+an∈Fq[x].当n≥7时,文[8]指出存在Fq上可预先指定a1,a2的n次本原多项式.本文讨论了剩余的n=5,6两种情形,利用有限域上的两类特征和估计及Cohen筛法(见[4,6]),改进了文[8]中关于本原解个数的下界,并得到当n=5,6时,在特征为奇的有限域上存在可预先指定前两项系数的n次本原多项式.     

有限域上本原多项式系数的研究

设Fq表示有q个元素的有限域,q为素数的方幂,f(x)=xn+a1xn-1+…+an-1x+an∈Fq[x].当n(≥)7时,文[8]指出存在Fq上可预先指定a1,a2的n次本原多项式.本文讨论了剩余的n=5,6两种情形,利用有限域上的两类特征和估计及Cohen筛法(见[4,6]),改进了文[8]中关于本原解个数的下界,并得到当n=5,6时,在特征为奇的有限域上存在可预先指定前两项系数的n次本原多项式.     

有限域上与仿射多项式有关的一些多项式的可约性

在这篇文章中,研究了有限域上一些与仿射多项式有关的多项式的可约性.对于有限域Fp上不是xppt-x-1的仿射三项式,得到了这些三项式的一个明确的因式.完全确定了多项式g(xps-ax-b)在Fp[x]中的分解,这里g(x)是Fp[x]中一个不可约多项式.证明了Fp上次数相同的不可约多项式的全体可以构成一个正则图.同时给出了多项式g(xqs-x-b)在Fp[x]不可约因式的个数公式,这里g(x)是Fp上一个不可约多项式.     

Self-Reciprocal Irreducible Polynomials Over Finite Fields

We classify monic self-reciprocal irreducible polynomials over finite fields in terms of their orders. We also study the weights of these polynomials.     

q-Rook Polynomials and Matrices over Finite Fields

Connections betweenq-rook polynomials and matrices over finite fields are exploited to derive a new statistic for Garsia and Remmel'sq-hit polynomial. Both this new statisticmatand another statistic for theq-hit polynomial ξ recently introduced by Dworkin are shown to induce different multiset Mahonian permutation statistics for any Ferrers board. In addition, for the triangular boards they are shown to generate different families of Euler–Mahonian statistics. For these boards the ξ family includes Denert's statisticden, and gives a new proof of Foata and Zeilberger's Theorem that (exc, den) is equidistributed with (des, maj). Thematfamily appears to be new. A proof is also given that theq-hit polynomials are symmetric and unimodal.     

On Characteristic Polynomials of Formal Groups over Finite Fields

Generalizing the results of Serre, Hill and Koch, we give some classification theorems of higher dimensional simple formal groups over finite fields. A relation between endomorphism rings of formal groups over ?_p and characteristic polynomials of their reductions mod p is studied. A condition of existence of formal groups over ?_p with complex multiplication is given. Some formal groups over ?_p are also constructed.     

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.     

与有限域上置换多项式交换的多项式的算法

An efficient algorithm for determining polynomials that commute with apermutation polynomial over a finite field is given. The complexity of the algorithm isdiscussed and examples of applying the algorithm are also provided.     

关于有限域F_q上矩阵阶的研究

详细地研究了有限域 Fq上的矩阵的阶的问题 ,得到了相当理想的结果 .并给出一类矩阵方幂的极小多项式的求法     

Taking pth Roots Modulo Polynomials over Finite Fields

In this contribution we show how to find y(x) in the polynomial equation y(x) ^p t(x) mod f(x), where t(x), y(x) and f(x) are polynomials over the field GF(p ^m). The solution of such equations are thought for in many cases, e.g., for p = 2 it is a step in the so-called Patterson Algorithm for decoding binary Goppa codes.     

On Ordinary Words of Standard Reed-Solomon Codes over Finite Fields

Reed-Solomon codes are widely used to establish a reliable channel to transmit information in digital communication which has a strong error correction capability and a variety of efficient decoding algorithm.Usually we use the maximum likelihood decoding(MLD) algorithm in the decoding process of Reed-Solomon codes.MLD algorithm relies on determining the error distance of received word.Dür,Guruswami,Wan,Li,Hong,Wu,Yue and Zhu et al.got some results on the error distance.For the Reed-Solomon code C,the received word u is called an ordinary word of C if the error distance d(u,C) =n-deg u(x) with u(x) being the Lagrange interpolation polynomial of u.We introduce a new method of studying the ordinary words.In fact,we make use of the result obtained by Y.C.Xu and S.F.Hong on the decomposition of certain polynomials over the finite field to determine all the ordinary words of the standard Reed-Solomon codes over the finite field of q elements.This completely answers an open problem raised by Li and Wan in[On the subset sum problem over finite fields,Finite Fields Appl.14 (2008) 911-929].     

某些对角方程在有限域上的解数

主要运用Gauss和以及Jacobi和的相关性质给出两类对角方程在有限域上的解数公式,分别是形如s∑(i=1) a_ix_i~(m_i)=c的对角方程,其中a_i,c∈F_q~2~*,(m_i,m_j)=1,m_i|(q+1),m_i为奇数或(q+1)/(m_i)为偶数,i=1,2,…,s,以及形如s∑(i=1) x_i~m=c的对角方程,其中c∈F_q~*,m|(q+1),m为奇数或(q+1)/m为偶数.