Abstract

In this paper, we investigate various “arithmetical” functions associated with the factorisation of polynomials in GF[q, X1, …, Xk], where k ≥ 1 and GF[q]is the finite field of order q. We shall assume throughout that all polynomials discussed are non-zero and have been normalised by selecting one polynomial from each equivalence class with respect to multiplication by non-zero elements of GF[q]. The constant polynomial will be denoted by 1. With this normalisation, GF[q, X1, …, Xk] becomes a unique factorisation domain. When k = 1, normalisation is achieved by considering only monic polynomials. By the degree of a polynomial A(X1, …, Xk) will be understood the ordered set (m1, …, mk), where m1 is the degree of A(X1, …, Xk) in X1,(i = 1, …, k).

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call