This paper contains a self-contained, minimal computational account of Cohen's 1990 theorem that there exists a primitive element of a given finite field with arbitrary prescribed trace over a subfield. The only non-trivial exception is that there is no primitive element in the 64-element field with trace zero over the 4-element field. The original proof was deduced from a number of results on different themes, involving more computation and direct verification. Consequently, the proof is more in tune with current general approaches to the 1992 Hansen-Mullen primitivity conjecture
Let E be a finite degree extension over a finite field F = GF(q), G the Galois group of E over F and...
We prove that for all q > 61, every non-zero element in the finite field Fq can be written as a l...
International audienceLet p be a prime number and let q = p(r). If C and D are large subsets of F-q(...
AbstractLet Fq denote the finite field of order q, a power of a prime p, and n be a positive integer...
AbstractWith one non-trivial exception, GF(qn) contains a primitive element of arbitrary trace over ...
AbstractLet GF(q) denote the finite field of order q, a power of a prime p, and m a positive integer...
The key result linking the additive and multiplicative structure of a finite field is the Primitive ...
AbstractThe primitive elements of a finite field are those elements of the field that generate the m...
Given a field F and elements \alpha and \beta not in F, then F(\alpha, \beta) is the smallest field ...
AbstractThe object of this paper is to present a simple proof for the existence of primitive element...
This paper presents an explicit bound on the number of primitive elements that are linear combinatio...
This thesis concerns existence of primitive polynomials over finite fields with one coefficient arbi...
AbstractA characterization of primitive polynomials, among irreducible polynomials, over a finite fi...
We discuss the problem of constructing a small subset of a finite field containing primitive element...
Given the extension E/F of Galois fields, where F = GF(q) and E = GF(q^n), we prove that, for any pr...
Let E be a finite degree extension over a finite field F = GF(q), G the Galois group of E over F and...
We prove that for all q > 61, every non-zero element in the finite field Fq can be written as a l...
International audienceLet p be a prime number and let q = p(r). If C and D are large subsets of F-q(...
AbstractLet Fq denote the finite field of order q, a power of a prime p, and n be a positive integer...
AbstractWith one non-trivial exception, GF(qn) contains a primitive element of arbitrary trace over ...
AbstractLet GF(q) denote the finite field of order q, a power of a prime p, and m a positive integer...
The key result linking the additive and multiplicative structure of a finite field is the Primitive ...
AbstractThe primitive elements of a finite field are those elements of the field that generate the m...
Given a field F and elements \alpha and \beta not in F, then F(\alpha, \beta) is the smallest field ...
AbstractThe object of this paper is to present a simple proof for the existence of primitive element...
This paper presents an explicit bound on the number of primitive elements that are linear combinatio...
This thesis concerns existence of primitive polynomials over finite fields with one coefficient arbi...
AbstractA characterization of primitive polynomials, among irreducible polynomials, over a finite fi...
We discuss the problem of constructing a small subset of a finite field containing primitive element...
Given the extension E/F of Galois fields, where F = GF(q) and E = GF(q^n), we prove that, for any pr...
Let E be a finite degree extension over a finite field F = GF(q), G the Galois group of E over F and...
We prove that for all q > 61, every non-zero element in the finite field Fq can be written as a l...
International audienceLet p be a prime number and let q = p(r). If C and D are large subsets of F-q(...