Polynomials over finite fields which commute with linear permutations
HTML articles powered by AMS MathViewer
- by Gary L. Mullen
- Proc. Amer. Math. Soc. 84 (1982), 315-317
- DOI: https://doi.org/10.1090/S0002-9939-1982-0640221-5
- PDF | Request permission
Abstract:
The polynomials over a finite field which commute with an arbitrary linear permutation of the field are characterized. This characterization is obtained through the use of a result from Pólya’s theory of enumeration.References
- N. G. deBruijn, Pólya’s theory of counting, Applied Combinatorial Mathematics, (Ed., E. F. Beckenbach), Wiley, New York, 1964.
- Leonard Eugene Dickson, Linear groups: With an exposition of the Galois field theory, Dover Publications, Inc., New York, 1958. With an introduction by W. Magnus. MR 0104735
- Charles Wells, Polynomials over finite fields which commute with translations, Proc. Amer. Math. Soc. 46 (1974), 347–350. MR 347785, DOI 10.1090/S0002-9939-1974-0347785-5
Bibliographic Information
- © Copyright 1982 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 84 (1982), 315-317
- MSC: Primary 12C05; Secondary 15A33, 20B05
- DOI: https://doi.org/10.1090/S0002-9939-1982-0640221-5
- MathSciNet review: 640221