x~N ±a在有限域上的完全分解

设F_q为一个阶为q的有限域,其中q为奇素数的幂.本文主要利用多项式分解相关理论得到几类多项式的完全分解,给出了当N=2~mp~n时x~N±a∈F_q[x]在F_q上的完全分解,其中m,n均为正整数,p为q-1的素因子,且p≠2.结果表明当a取作F_q中元素β的某些特殊方幂时,x~N±a在F_q上不可约因式都是二项式或三项式.     

有限域上一类正形置换多项式

有限域F_(2~n)上,g(x)=b_2~dx~2~d+b_2~(d-1)x~2~(d-1)+…+b_2x~2+b_1x+b_0是2~d次仿射多项式,利用同余类知识和有限域上乘积多项式的次数分布规律,研究了F_(2~n)上形如xg(x)的2~d+1次正形置换多项式的存在性.     

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

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

整系数多项式的哥德巴赫定理

哥德巴赫猜想断定每一个比4大的偶数是两个素数的和、用Z表示整数环,多项式环Z[x]与Z一样是一个唯一分解整环,其中不可约多项式相当于整数中的素数。本文的目的是证明多项式环Z[x]中与哥德巴赫猜想类似的定理。 定理1.在Z[x]中每一个次数n≥1的多项式M可以写成两个不可约n次多项式A与B的和,即     

确定有限域上给定周期的不可约多项式的个数以及利用低次不可约多项式构造高次不可约多项式

主要利用较献[4]更为简明的方法证明了有关有限域Fq(q为一个素数幂）上的以l为周期的n次不可约多项式的个数的结论。另外，本结合结合初等数论知识得到了前面这个结论的几个推论，并对利用低次不可约多项式构造高次不可约多项式进行了研究。     

关于Eisenstein判别法的一点注记

判断一个整系数多项式在有理数域上不可约,有著名的充分条件—Eisenstein判别法(参见[1]或[2])。由于对整系数多项式f(x)和任意整数b,f(x)与整系数多项式g(y)=f(y+b)在有理数域上同时为可约或不可约,所以在证明f(x)不可约时,如果f(x)不满足     

关于多项式最大公因式的进一步探讨

在[1]中有这样一个结论，对于P[x]中任意两个多项式，f(x)、g(x)．在P[x]中存在一个最大公因式d(x),且d(x)可以表示成f(x)、g(x)的一个组合．即有P[x]中的多项式u(x)、v(x)使：     

分圆多项式既约因式Φm（x）的快速计算方法

1 引言关于分圆多项式既约因式φm(x)的系数问题,近来《数学通报》连续刊登三篇文章(详见[1]、[2]、[3]进行讨论,为免于如[1]所指出的计算φm(x)时需作大量的多项式除法运算的不足,在文[2]的基础上,本文提出一种速算法,并应用它纠正了文[3]中一个反例φm(x)(m=399)的错误。2 方法     

一类不可约多项式的邻接矩阵

Dong和Pei在文[Construction for de Bruijn sequences with large stage,Des.Codes Cryptogr,2017,85(2):343-358]中利用F_2[x]的n次不可约多项式构造大级数de Bruijn序列.不可约多项式的邻接矩阵从理论上给出了这种方法能构造de Bruijn序列的数目.我们给出一类特殊不可约多项式的邻接矩阵,从理论上给出了用这类不可约多项式能够构造的de Bruijn序列的数目.     

棋盘游戏与有限域上多项式分解算法

将有限域F_2上多项式分解问题转化为一种对应的棋盘游戏,利用后者的性质设计了一个F_2上m+n-2次多项式f(x)分解为一个m-1次多项式与一个n-1次多项式的判断、分解算法,并对算法的复杂度进行了分析.算法的一个优势是,如果f(x)不能按要求分解,也可以找到一个与f(x)相近(这里指系数相异项较少)的多项式的分解.     

Irreducibility results for compositions of polynomials in several variables

We obtain explicit upper bounds for the number of irreducible factors for a class of compositions of polynomials in several variables over a given field. In particular, some irreducibility criteria are given for this class of compositions of polynomials.     

Three addition theorems for someq-Krawtchouk polynomials

Theq-Krawtchouk polynomials are the spherical functions for three different Chevalley groups over a finite field. Using techniques of Dunkl to decompose the irreducible representations with respect to a maximal parabolic subgroup, we derive three addition theorems. The associated polynomials are related to affine matrix groups.During the preparation of this paper the author was partially supported by NSF grant MCS78-02410.     

Explicit theorems on generator polynomials

Progress over the past decade is surveyed concerning explicit existence and construction theorems on irreducible, primitive and normal polynomials.     

On explicit factors of cyclotomic polynomials over finite fields

We study the explicit factorization of 2 ⁿ r-th cyclotomic polynomials over finite field \mathbbF_q{\mathbb{F}_q} where q, r are odd with (r, q) = 1. We show that all irreducible factors of 2 ⁿ r-th cyclotomic polynomials can be obtained easily from irreducible factors of cyclotomic polynomials of small orders. In particular, we obtain the explicit factorization of 2 ⁿ 5-th cyclotomic polynomials over finite fields and construct several classes of irreducible polynomials of degree 2 ^n–2 with fewer than 5 terms.     

Necklaces,symmetries and self-reciprocal polynomials

The connection between a certain class of necklaces and self-reciprocal polynomials over finite fields is shown. For n?2, self-reciprocal polynomials of degree 2n arising from monic irreducible polynomials of degree n are shown to be either irreducible or the product or two irreducible factors which are necessarily reciprocal polynomials. Using DeBruijn's method we count the number of necklaces in this class and hence obtain a formula for the number of irreducible self-reciprocal polynomials showing that they exist for every even degree. Thus every extension of a finite field of even degree can be obtained by adjoining a root of an irreducible self-reciprocal polynomial.     

On the number of irreducible linear transformation shift registers

We deal with the problem of counting the number of irreducible linear transformation shift registers (TSRs) over a finite field. In a recent paper, Ram reduced this problem to calculate the cardinality of some set of irreducible polynomials and got explicit formulae for the number of irreducible TSRs of order two. We find a bijection between Ram’s set to another set of irreducible polynomials which is easier to count, and then give a conjecture about the number of irreducible TSRs of any order. We also get explicit formulae for the number of irreducible TSRs of order three.     

Recurrent methods for constructing irreducible polynomials over Fq of odd characteristics,II

In this paper computationally easy explicit constructions of sequences of irreducible and normal monic polynomials over finite fields of odd characteristic are presented.     

Symmetric determinantal representation of polynomials

We give an elementary proof, only using linear algebra, of a result due to Helton, Mccullough and Vinnikov, which says that any polynomial over the reals can be written as the determinant of a symmetric affine linear pencil. We give explicit determinantal representation formulas and extend our results to polynomials with coefficients in a ring of characteristic different from 2.     

A correspondence of certain irreducible polynomials over finite fields

An explicit correspondence between certain cubic irreducible polynomials over ${\mathbb{F}}_q$ and cubic irreducible polynomials of special type over ${\mathbb{F}}_{q^2}$ was established by Kim et al. In this paper, we give a generalization of their result to irreducible polynomials of odd prime degree. Our result includes the result of Kim et al. as a special case where the degree is three.     

An extension of a result of Zaharescu on irreducible polynomials

It is well known that if f(x) is a monic irreducible polynomial of degree d with coefficients in a complete valued field (K, ‖), then any monic polynomial of degree d over K which is sufficiently close to f(x) with respect to ‖ is also irreducible over K. In 2004, Zaharescu proved a similar result applicable to separable, irreducible polynomials over valued fields which are not necessarily complete. In this paper, the authors extend Zaharescu’s result to all irreducible polynomials without assuming separability.