A class of permutation trinomials over finite fields
Let q > 2 be a prime power and , where . We prove that f is a permutation polynomial of if and only if one of the following occurs: (i) q is even and ; (ii) q ≡ 1 (mod 8) and t² = -2.
A Goldbach theorem for polynomials of low degree over odd finite fields
A lower bound theorem in Fq[x].
A method for solving equations in finite fields
A notion of density and essential components in GF[p,x]
A polynomial representation for logarithms in GF(q)
A quick and dirty irreducibility test for multivariate polynomials over .
Addition theorems in F q [x].
Addition theorems in Fq [x].
An analogue of the Erdős-Ginzburg-Ziv theorem for quadratic symmetric polynomials.
Arithmetical properties of function fields (II). The generalized Schur problem