On permutation polynomials over finite fields /
||The system is temporarily closed to updates for reporting purpose.
Aksoy, Esen (2006) On permutation polynomials over finite fields /. [Thesis]
Official URL: http://risc01.sabanciuniv.edu/record=b1164871 (Table of Contents)
A permutation polynomial (PP) over a nite eld Fq is a polynomial in Fq[x] which induces a bijective map from Fq to itself. PPs are of great theoretical interest and are also needed for applications. This thesis starts with some basic facts about PPs. Recent results about one of the most important open problems in this topic: counting PPs of a given degree, are presented. Well known classes of PPs are the linear polynomials, the monomials xk, with gcd(k, q 1) = 1, the linearized polynomials, and the Dickson polynomials. It turns out that nding new classes of PPs is not easy. We also focus on this problem and give a survey of some recent constructions.
|Uncontrolled Keywords:||Permutation polynomials -- Finite fields -- Binomials -- Monomials -- Dickson polynomials -- symmetric group of degree n.|
|Subjects:||Q Science > QA Mathematics|
|Deposited On:||16 Apr 2008 12:29|
|Last Modified:||25 Mar 2019 16:54|
Repository Staff Only: item control page