Ashlock, Daniel Abram (1990) A theory of permutation polynomials using compositional attractors. Dissertation (Ph.D.), California Institute of Technology. http://resolver.caltech.edu/CaltechETD:etd-06022006-085847
NOTE: Text or symbols not renderable in plain ASCII are indicated by [...]. Abstract is included in .pdf document. In this work I will develop a theory of permutation polynomials with coefficients over finite commutative rings. The general situation will be that we have a finite ring R and a ring S, both with 1, with S commutative, and with a scalar multiplication of elements of R by elements of S, so that for each r in R 1s • r = r and with the scalar multiplication being R bilinear. When all these conditions hold, I will call R an S-algebra. A permutation polynomial will be a polynomial of S[x] with the property that the function r [...] f(r) is a bijection, or permutation, of R.
|Item Type:||Thesis (Dissertation (Ph.D.))|
|Degree Grantor:||California Institute of Technology|
|Division:||Physics, Mathematics and Astronomy|
|Thesis Availability:||Public (worldwide access)|
|Defense Date:||7 May 1990|
|Non-Caltech Author Email:||dashlock (AT) uoguelph.ca|
|Default Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Imported from ETD-db|
|Deposited On:||02 Jun 2006|
|Last Modified:||26 Dec 2012 02:50|
- Final Version
See Usage Policy.
Repository Staff Only: item control page