Let p be a prime, p a power of p and 𝔽q the finite field with q elements. Any function φ: 𝔽q → 𝔽q can be unqiuely represented by a polynomial, 𝔽φ of degree < q. If the map x ↦ Fφ(x) induces a permutation on the underlying field we say Fφ is a permutation polynomial. Permutation polynomials have applications in many diverse fields of mathematics. In this dissertation we are generally concerned with the following question: Given a polynomial f, when does the map x ↦ F(x) induce a permutation on 𝔽q.
In the second chapter we are concerned the permutation behavior of the polynomial gn,q, a q-ary version of the reversed Dickson polynomial, when the integer n is of the form n = qa - qb - 1. This leads to the third chapter where we consider binomials and trinomials taking special forms. In this case we are able to give explicit conditions that guarantee the given binomial or trinomial is a permutation polynomial.
In the fourth chapter we are concerned with permutation polynomials of 𝔽q, where q is even, that can be represented as the sum of a power function and a linearized polynomial. These types of permutation polynomials have applications in cryptography. Lastly, chapter five is concerned with a conjecture on monomial graphs that can be formulated in terms of polynomials over finite fields.
| Identifer | oai:union.ndltd.org:USF/oai:scholarcommons.usf.edu:etd-7489 |
| Date | 27 June 2016 |
| Creators | Lappano, Stephen |
| Publisher | Scholar Commons |
| Source Sets | University of South Flordia |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | Graduate Theses and Dissertations |
| Rights | default |
Page generated in 0.0019 seconds