Hostname: page-component-586b7cd67f-rdxmf Total loading time: 0 Render date: 2024-11-24T09:07:11.698Z Has data issue: false hasContentIssue false
  • English
  • Français

Permutation Functions on a Finite Field

Published online by Cambridge University Press:  20 November 2018

Aiden Bruen
Aiden Bruen*
Affiliation:
Colorado State University, Fort Collins, ColoradoUniversity of Western Ontario, London, Ontario
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.

Using a well-known theorem of Burnside on permutation groups of prime degree we offer new and simplified proofs of Theorems A, B, B' below for the case q=p a prime.

Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 15 , Issue 4 , December 1972 , pp. 595 - 597
Copyright
Copyright © Canadian Mathematical Society 1972

References

1. Carlitz, L., A theorem on permutations in a finite field, Proc. Amer. Math. Soc. 11 (1960), 456-459.Google Scholar
2. McConnel, R., Pseudo ordered polynomials over a finite field, Acta Arith. 8 (1963), 127-151.Google Scholar
3. Ostrom, T. G., Vector spaces and construction of finite projective planes, Arch. Math. 19 (1968), 1-25.Google Scholar
4. Passman, D. S., Permutation groups. Benjamin, New York, 1968.Google Scholar