Sequences of binary irreducible polynomials

In this paper we construct an infinite sequence of binary irreducible polynomials starting from any irreducible polynomial $f_0\in F_2\left[x\right]$. If $f_0$ is of degree $n=2^l?m$, where $m$ is odd and $l$ is a nonnegative integer, after an initial finite sequence of polynomials $f_0,f_1,\dots ,f_s$, with $s\le l+3$, the degree of $f_{i+1}$ is twice the degree of $f_i$ for any $i\ge s$.     

Counting irreducible polynomials with prescribed coefficients over a finite field

We continue our study on counting irreducible polynomials over a finite field with prescribed coefficients. We set up a general combinatorial framework using generating functions with coefficients from a group algebra which is generated by equivalence classes of polynomials with prescribed coefficients. Simplified expressions are derived for some special cases. Our results extend some earlier results.     

Counting irreducible polynomials over finite fields

In this paper we generalize the method used to prove the Prime Number Theorem to deal with finite fields, and prove the following theorem:

Congruence preserving functions in the residue class rings of polynomials over finite fields

In this paper, as an analogue of the integer case, we define congruence preserving functions over the residue class rings of polynomials over finite fields. We establish a counting formula for such congruence preserving functions, determine a necessary and sufficient condition under which all congruence preserving functions are also polynomial functions, and characterize such functions.     

Generators and irreducible polynomials over finite fields

Weil's character sum estimate is used to study the problem of constructing generators for the multiplicative group of a finite field. An application to the distribution of irreducible polynomials is given, which confirms an asymptotic version of a conjecture of Hansen-Mullen.

     

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

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

Explicit factors of generalized cyclotomic polynomials and generalized Dickson polynomials of order 2m3 over finite fields

In this paper, we derive explicit factorizations of generalized cyclotomic polynomials and generalized Dickson polynomials of the first kind of order $2^{m}3$, over finite field $F_q$.     

On evaluating multivariate polynomials over finite fields

Some evaluation methods of multivariate polynomials over finite fields are described and their multiplicative complexity is discussed.