Hostname: page-component-586b7cd67f-tf8b9 Total loading time: 0 Render date: 2024-11-22T20:42:08.110Z Has data issue: false hasContentIssue false

Some arithmetical functions in finite fields

Published online by Cambridge University Press:  18 May 2009

Stephen D. Cohen
Affiliation:
University of Glasgow, Glasgow, W.2.
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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).

Type
Research Article
Copyright
Copyright © Glasgow Mathematical Journal Trust 1970

References

REFERENCES

1.Carlitz, L., The arithmetic of polynomials in a Galois field, Amer. J. Math. 54 (1932), 3950.CrossRefGoogle Scholar
2.Carlitz, L., The distribution of irreducible polynomials in several indeterminates II, Canad. J. Math. 17 (1965), 261266.CrossRefGoogle Scholar
3.Cohen, S. D., The distribution of irreducible polynomials in several indeterminates over a finite field, Proc. Edinburgh Math. Soc. 16 (1968), 117.CrossRefGoogle Scholar