Kalaycı, Tekgül
(2018)
*On factorization of some permutation polynomials over finite fields.*
[Thesis]

PDF

10231532_TekgulKalayci.pdf

Download (473kB)

10231532_TekgulKalayci.pdf

Download (473kB)

## Abstract

Factorization of polynomials over finite fields is a classical problem, going back to the 19th century. However, factorization of an important class, namely, of permutation polynomials was not studied previously. In this thesis we present results on factorization of permutation polynomials of Fq,q 2: In order to tackle this problem, we consider permutation polynomials Fn(x)2 Fq[x], n 0; which are defined recursively as compositions of monomials of degree d with gcd(d;q {u100000} 1) = 1, and linear polynomials. Extensions of Fq defined by using the recursive structure of Fn(x) satisfy particular properties that enable us to employ techniques from Galois theory. In consequence, we obtain a variety of results on degrees and number of irreducible factors of the polynomials Fn(x).

Item Type: | Thesis |
---|---|

Uncontrolled Keywords: | Finite fields. -- Permutation polynomials. -- Factorization of polynomials. -- Irreducible polynomials. -- Sonlu cisimler. -- Permütasyon polinomları. -- Polinomların çarpanlara ayrılması. -- İndirgenemez polinomlar. |

Subjects: | Q Science > QA Mathematics |

Divisions: | Faculty of Engineering and Natural Sciences > Basic Sciences > Mathematics Faculty of Engineering and Natural Sciences |

Depositing User: | IC-Cataloging |

Date Deposited: | 21 Feb 2019 10:20 |

Last Modified: | 26 Apr 2022 10:29 |

URI: | https://research.sabanciuniv.edu/id/eprint/36860 |