Enumerating Permutation Polynomials I : Permutations with Non-Maximal Degree

@inproceedings{Malvenuto2002EnumeratingPP,
  title={Enumerating Permutation Polynomials I : Permutations with Non-Maximal Degree},
  author={Claudia Malvenuto},
  year={2002}
}
Let C be a conjugation class of permutations of a finite field Fq. We consider the function NCðqÞ defined as the number of permutations in C for which the associated permutation polynomial has degree 5q 2. In 1969, Wells proved a formula for N1⁄23 ðqÞ where 1⁄2k denotes the conjugation class of k-cycles. We will prove formulas for N1⁄2k ðqÞ where k 1⁄4 4; 5… CONTINUE READING