Finite fields and Frobenius
Every finite field has a unique extension of each degree, up to isomorphism. Frobenius determines conjugates, subfields, and factor degrees.
ArticleIrreducibility over finite fields
Frobenius gives an exact irreducibility test, a counting formula, and a method for constructing irreducible polynomials.
ArticleIrreducible polynomials with coefficient restrictions
Prescribed coefficients and allowed coefficient sets lead to different existence and counting problems. Trace and norm explain the first and constant coefficients; character sums and sieves treat more general restrictions.
ArticlePrimitive and normal elements
A primitive element generates the multiplicative group. The conjugates of a normal element form a basis. Every finite-field extension contains an element with both properties.
ArticleFactorization statistics over finite fields
Factor degrees follow permutation cycle statistics in several large-field limits. Exact counting explains the unrestricted case; monodromy and point counting handle suitable families.
ArticleSparse irreducible polynomials over finite fields
Sparse irreducibles give efficient finite-field representations. Their existence depends on the support, while sparse factors of cyclotomic polynomials form a separate classification problem.
ArticleReferences
- New algorithms for finding irreducible polynomials over finite fieldsShoup, Victor · 1990
Constructs irreducible polynomials of a prescribed degree, including deterministic polynomial-time results for small characteristic. Distinguish dependence polynomial in the characteristic from dependence polynomial in its bit length.
- Primitive polynomials over finite fieldsHansen, Tom and Mullen, Gary L. · 1992
Provides explicit primitive-polynomial tables and formulates influential existence conjectures with one prescribed coefficient. The primitivity question and the irreducibility question are distinct; a primitive polynomial has a root generating the multiplicative group of the extension field.
- Fast construction of irreducible polynomials over finite fieldsShoup, Victor · 1994
Gives faster algorithms for constructing an irreducible polynomial of specified degree over a finite field, thereby producing an explicit representation of the corresponding extension field.
- Generators and irreducible polynomials over finite fieldsWan, Daqing · 1997
Uses character-sum estimates to study generators and irreducible polynomials with prescribed coefficients. Establishes the Hansen–Mullen irreducibility assertion outside finitely many cases; Ham and Mullen settle the remaining cases.
- Distribution of irreducible polynomials of small degrees over finite fieldsHam, Kie H. and Mullen, Gary L. · 1998
Completes the Hansen–Mullen irreducibility conjecture by verifying the finite set of cases left by Wan's theorem. The statement includes necessary exceptions, notably a prescribed zero constant coefficient and the quadratic zero-linear-coefficient case in characteristic two.
Comments
Any comments are welcome. Comments appear after the site owner approves them. Privacy policy.