Counting irreducible factors of polynomials over a finite field, Discrete Mathematics, 112 (1993) 103-l 18. Let F,[X] denote a polynomial ring in an indeterminate X over a finite field IF,. Exact formulae are derived for (i) the number of polynomials of degree n in F,[X] with a specified number of i
A test for additive decomposability of irreducibles over a finite field
โ Scribed by J.V. Brawley; L. Carlitz
- Publisher
- Elsevier Science
- Year
- 1989
- Tongue
- English
- Weight
- 456 KB
- Volume
- 76
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
โฆ Synopsis
A polynomial h over a field F is said to be additively decomposable over F if there exist polynomials f and g in F[x] each of degree ~1 sue% l h L at the roots of h are precisely all sums Q! + j3 of roots LY off and j3 of g. This paper derives a test for determining whether or not a given irreducible over a finite field is additively decomposable.
๐ SIMILAR VOLUMES
Let f (x, y) be a polynomial defined over Z in two variables of total degree d 2, and let Vp=[(x, y) # C p : f(x, y)#0 (mod p)] for each prime p, where C p = [(x, y) # Z 2 : 0 x<p and 0 y<p]. In this paper, we show that if f (x, y) is absolutely irreducible modulo p for all sufficiently large p, the
Generalizing the norm and trace mappings for % O P /% O , we introduce an interesting class of polynomials over "nite "elds and study their properties. These polynomials are then used to construct curves over "nite "elds with many rational points.