In this paper we consider squarefree polynomials over finite fields whose gcd with their reciprocal and Frobenius conjugate polynomial is trivial, respectively. Our focus is on the enumeration of these special sets of polynomials, in particular, we give the number of squarefree palindromes. These in
On the Value Sets of Special Polynomials over Finite Fields
β Scribed by Abramo Hefez
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 225 KB
- Volume
- 2
- Category
- Article
- ISSN
- 1071-5797
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We study value sets of polynomials over a finite field, and value sets associated to pairs of such polynomials. For example, we show that the value sets (counting multiplicities) of two polynomials of degree at most d are identical or have at most q!(q!1)/d values in common where q is the number of
Let T n (x, a) Κ¦ GF(q)[x] be a Dickson polynomial over the finite field GF(q) of either the first kind or the second kind of degree n in the indeterminate x and with parameter a. We give a complete description of the factorization of T n (x, a) over GF(q).
Let p'2 be a prime, denote by F N the "eld with "F N ""p, and let and f takes only two values on F\* N , then (excluding some exceptional cases) the degree of f is at least (p!1).