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:

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.

     

The number of irreducible polynomials over finite fields of characteristic 2 with given trace and subtrace

In this paper we obtained the formula for the number of irreducible polynomials with degree n over finite fields of characteristic two with given trace and subtrace. This formula is a generalization of the result of Cattell et al. (2003) [2].     

Generating series for irreducible polynomials over finite fields

We count the number of irreducible polynomials in several variables of a given degree over a finite field. The results are expressed in terms of a generating series, an exact formula and an asymptotic approximation. We also consider the case of the multi-degree and the case of indecomposable polynomials.     

Fast construction of irreducible polynomials over finite fields

We present a randomized algorithm that on inputting a finite field K with q elements and a positive integer d outputs a degree d irreducible polynomial in K[x]. The running time is d ^1+?(d)×(log q)^5+?(q) elementary operations. The function ? in this expression is a real positive function belonging to the class o(1), especially, the complexity is quasi-linear in the degree d. Once given such an irreducible polynomial of degree d, we can compute random irreducible polynomials of degree d at the expense of d ^1+?(d) × (log q)^1+?(q) elementary operations only.     

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.     

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.     

The explicit construction of irreducible polynomials over finite fields

For a finite field GF(q) of odd prime power order q, and n 1, we construct explicitly a sequence of monic irreducible reciprocal polynomials of degree n2 ^m (m = 1, 2, 3, ...) over GF(q). It is the analog for fields of odd order of constructions of Wiedemann and of Meyn over GF(2). We also deduce iterated presentations of GF (q ⁿ 2).     

Topologically transitive semigroup actions of real linear fractional transformations

Let , where I is a proper closed subinterval of R. Our main goal in this paper is to describe all f,g∈FI such that the action of the semigroup generated by f and g is topologically transitive on I. We also prove that this action is never weakly topologically mixing. Finally, we describe all pairs of affine functions on R whose generated semigroup action is weakly topologically mixing.     

一类分式线性变换群的有限子群

证明PGL(2,Q)中仅有17个系数形如m n p的分式线性变换有限子群并且决定了它们的构造,其中m,n是整数,p是素数.     

Distribution of irreducible polynomials of small degrees over finite fields

D. Wan very recently proved an asymptotic version of a conjecture of Hansen and Mullen concerning the distribution of irreducible polynomials over finite fields. In this note we prove that the conjecture is true in general by using machine calculation to verify the open cases remaining after Wan's work.

     

Permutation polynomials from trace functions over finite fields

In this paper, we propose several classes of permutation polynomials based on trace functions over finite fields of characteristic 2. The main result of this paper is obtained by determining the number of solutions of certain equations over finite fields.     

Number of irreducible polynomials and pairs of relatively prime polynomials in several variables over finite fields

We discuss several enumerative results for irreducible polynomials of a given degree and pairs of relatively prime polynomials of given degrees in several variables over finite fields. Two notions of degree, the total degree and the vector degree, are considered. We show that the number of irreducibles can be computed recursively by degree and that the number of relatively prime pairs can be expressed in terms of the number of irreducibles. We also obtain asymptotic formulas for the number of irreducibles and the number of relatively prime pairs. The asymptotic formulas for the number of irreducibles generalize and improve several previous results by Carlitz, Cohen and Bodin.     

Hilbert's Tenth Problem for fields of rational functions over finite fields

Summary We prove that there is no algorithm to solve arbitrary polynomial equations over a field of rational functions in one letter with constants in a finite field of characteristic other than 2 and hence, Hilbert's Tenth Problem for any such field is undecidable.Oblatum 1-XI-1989Supported in part by NSF Grant DMS 8605198.     

A class of minimal cyclic codes over finite fields

Let ${\mathbb{F}}_q$ be a finite field of odd order $q$ and $n=2^a{p}_1^{a_1}{p}_2^{a_2}$, where $a,a_1,a_2$ are positive integers, $p_1,p_2$ are distinct odd primes and $4p_1{p}_2|q?1$. In this paper, we study the irreducible factorization of $x^n?1$ over ${\mathbb{F}}_q$ and all primitive idempotents in the ring ${\mathbb{F}}_q\left[x\right]∕〈x^n?1〉$.Moreover, we obtain the dimensions and the minimum Hamming distances of all irreducible cyclic codes of length $n$ over ${\mathbb{F}}_q$.