Generators and irreducible polynomials over finite fields
The author considers three fundamental problems of the theory of finite fields. (1) The first problem addresses the construction of a set of generators for the multiplicative group \(E^*\) of a finite field \(E\), ideally a primitive element for \(E\), where \(E\) is a nontrivial extension of some other finite field \(F\). Letting \(q\) be the cardinality of \(F\) and \(m>1\) the degree of \(E\) over \(F\), it is studied, under which conditions on \(m\) and \(q\), \(E^*\) is generated by every line \(F+\alpha\), where \(\alpha\) has degree \(m\) over \(F\) (Section 3). (2) The second problem concerns the distribution of primitive normal elements for a nontrivial extension \(E\) over \(F\) of finite fields. With \(q\) and \(m\) as in (1) the existence of absolute constants \(C_1\) and \(C_2\) is shown such that if \(q \geq C_1 \Omega_m\log^2(m)\) and \(\alpha\) is normal for \(E\) over \(F\), then there exists a primitive normal element of the form \(g(\alpha)\), where \(g\) is monic, irreducible over \(F\) of degree at most \(\lceil 6\log_q(m) + C_2\log_q(\)log\((q)) \rceil\). (3) The third problem concerns the distribution of irreducible polynomials over a finite field \(F\). A conjecture of Hansen and Mullen states that for every triple \((m,n,a)\) (\(m \geq 3\), \(m\geq n\geq 1\) integers, \(a \in F\), \(a \not=0\) if \(n=1\)) there exists a monic irreducible polynomial in \(F[T]\) of degree \(m\) such that the coefficient of \(T^{n-1}\) is equal to \(a\). The author proves an asymptotic result that confirms the Hansen-Mullen conjecture: the existence is guaranteed if either \(m \geq 36\) or \(q>19\). The fundamental tools used for the proofs are (estimates of) character sums. This excellent paper is an important contribution to the theory of finite fields. Section 2 on estimates of character sums is of individual interest.
- scientific article; zbMATH DE number 1588466
- Primitive polynomials with a prescribed coefficient
- Character sums over Galois rings and primitive polynomials over finite fields.
- A generalization of the Hansen-Mullen conjecture on irreducible polynomials over finite fields
- Irreducible polynomials over finite fields. I
- An Estimate for Character Sums
- Character sums and abelian Ramanujan graphs (with an appendix by Keqin Feng and Wen-Ch'ing Winnie Li)
- Diameters and Eigenvalues
- Factor Refinement
- Finding Isomorphisms Between Finite Fields
- scientific article; zbMATH DE number 426134 (Why is no real title available?)
- scientific article; zbMATH DE number 429512 (Why is no real title available?)
- scientific article; zbMATH DE number 50938 (Why is no real title available?)
- scientific article; zbMATH DE number 3510416 (Why is no real title available?)
- Primitive elements and polynomials with arbitrary trace
- Primitive Normal Bases for Finite Fields
- Primitive Polynomials Over Finite Fields
- Searching for Primitive Roots in Finite Fields
- The coefficients of primitive polynomials over finite fields
- On error distance of Reed-Solomon codes
- On certain diagonal equations over finite fields
- Normal generators of finite fields
- Irreducible polynomials over GF(2) with prescribed coefficients.
- Character sums, primitive elements, and powers in finite fields
- Explicit equivalence of quadratic forms over \(\mathbb{F}_q(t)\)
- Factor base discrete logarithms in Kummer extensions
- The arithmetic of consecutive polynomial sequences over finite fields
- Remarks on the distribution of the primitive roots of a prime
- Squarefree polynomials with prescribed coefficients
- Indiscreet logarithms in finite fields of small characteristic
- On enumeration of irreducible polynomials and related objects over a finite field with respect to their trace and norm
- Enumeration of self-reciprocal irreducible monic polynomials with prescribed leading coefficients over a finite field
- Unicyclic strong permutations
- Shift-inequivalent decimations of the Sidelnikov-Lempel-Cohn-Eastman sequences
- Further results on the Morgan-Mullen conjecture
- Polynomial values and generators with missing digits in finite fields
- On the squares in the set of elements of a finite field with constraints on the coefficients of its basis expansion
- Prescribing coefficients of invariant irreducible polynomials
- Generating sets for the multiplicative groups of algebras over finite fields and expander graphs
- On Reed-Solomon codes
- Irreducible polynomials with consecutive zero coefficients
- Primitive polynomials with a prescribed coefficient
- Explicit theorems on generator polynomials
- On the existence for some special primitive elements in finite fields
- Generators of finite fields with powers of trace zero and cyclotomic function fields
- Primitive idempotents in central simple algebras over \(\mathbb{F}_q(t)\) with an application to coding theory
- Averaging operators over homogeneous varieties over finite fields
- Traps to the BGJT-algorithm for discrete logarithms
- Algebraic Cayley graphs over finite fields
- Distribution of irreducible polynomials of small degrees over finite fields
- On the existence of some specific elements in finite fields of characteristic 2
- On the Hansen-Mullen conjecture for self-reciprocal irreducible polynomials
- On the discrete logarithm problem in finite fields of fixed characteristic
- On primitive normal elements over finite fields
- A note on the Hansen-Mullen conjecture for self-reciprocal irreducible polynomials
- GENERATING CERTAIN QUINTIC IRREDUCIBLE POLYNOMIALS OVER FINITE FIELDS
- On the existence of primitive normal elements of rational form over finite fields of even characteristic
- The existence of primitive normal elements of quadratic forms over finite fields
- Joint distribution in residue classes of polynomial-like multiplicative functions
- On the product of elements with prescribed trace
- On squares in special sets of finite fields
- Cayley graphs generated by small degree polynomials over finite fields
- A polynomial analogue of Landau's theorem and related problems
- A new proof of the Hansen-Mullen irreducibility conjecture
- Decompositions of matrices into diagonalizable and square-zero matrices
- Irreducible polynomials with several prescribed coefficients
- Irreducible polynomials with several prescribed coefficients
- Partial zeta functions of algebraic varieties over finite fields
- Generators of nonassociative simple Moufang loops over finite prime fields
- Pair of primitive normal elements of rational form over finite fields of characteristic 2
- A new perspective on the powers of two descent for discrete logarithms in finite fields
- New estimates and existence results about irreducible polynomials and self-reciprocal irreducible polynomials with prescribed coefficients over a finite field
- Existence of some specific elements in finite fields
- Distribution \(\bmod{p}\) of Euler's totient and the sum of proper divisors
- A new sieve for distinct coordinate counting
- New optimal optical orthogonal codes by restrictions to subgroups
- Self-reciprocal irreducible polynomials with prescribed coefficients
- On coefficients of polynomials over finite fields
- New supersets of Zadoff-Chu sequences via the Weil bound
- Algorithmic aspects of elliptic bases in finite field discrete logarithm algorithms
- Distribution of power residues over shifted subfields and maximal cliques in generalized Paley graphs
- Multiplicative character sums over two classes of subsets of quadratic extensions of finite fields
- A provably quasi-polynomial algorithm for the discrete logarithm problem in finite fields of small characteristic
- Counting irreducible polynomials with restricted coefficients
- Counting elements with given trace and norm in étale algebras
- On 2-superirreducible polynomials over finite fields
- Smooth symmetric systems over a finite field and applications
- Existence of special types of primitive pairs in finite fields avoiding affine hyperplanes
- Smooth polynomials with several prescribed coefficients
- Frobenius nonclassical components of curves with separated variables
- A generalization of the Hansen-Mullen conjecture on irreducible polynomials over finite fields
- On the number of N-free elements with prescribed trace
- The number of irreducible polynomials of degree n over F_q with given trace and constant terms
This page was built for publication: Generators and irreducible polynomials over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4340866)
