Repository logo
Log In(current)
  1. Home
  2. Colleges & Schools
  3. Graduate School
  4. Masters Theses
  5. Permutation Polynomials of Finite Fields
Details

Permutation Polynomials of Finite Fields

Date Issued
June 1, 1966
Author(s)
Lawkins, William F.
Advisor(s)
David R. Hayes
Abstract

A permutation polynomial of a finite field K is one for which the associated polynomial function is a one-to-one map from K onto itself. The purpose of this paper is to explain and demonstrate how algebraic geometry can be employed in determining permutation polynomials of finite fields of sufficiently large order. In Chapter II, definitions and well-known results from elementary algebraic geometry, which are used throughout the paper, are stated. As noted earlier, we shall deal only with finite fields whose order is sufficiently large. In Chapter III, results are obtained which are used later to establish criteria for the size of the finite fields to be considered. Also, by elementary means, the exact number of rational points on an absolutely irreducible projective quadratic curve is obtained. In Chapter IV, results given by Chevalley [1], which are used in Chapter III, are displayed, Chapters V through IX are devoted to determining the primary permutation polynomials of degrees four and five of finite fields of sufficiently large order, and the essential results of chapters VI through IX are compiled in Chapter X. The results for the cases which are considered in these chapters were known previously and can be found in Dickson's Linear Groups [2].

Degree
Master of Arts
Major
Mathematics
File(s)
Thumbnail Image
Name

Thesis66.L385.pdf

Size

1.98 MB

Format

Adobe PDF

Checksum (MD5)

483613e75417ba2333bfb7aec52aa28e

Learn more about how TRACE supports reserach impact and open access here.

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science

  • Privacy policy
  • End User Agreement
  • Send Feedback
  • Contact
  • Libraries at University of Tennessee, Knoxville
Repository logo COAR Notify