On the Carlitz Rank of Permutation Polynomials Over Finite Fields: Recent Developments

5Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The Carlitz rank of a permutation polynomial over a finite field Fq is a simple concept that was introduced in the last decade. In this survey article, we present various interesting results obtained by the use of this notion in the last few years. We emphasize the recent work of the authors on the permutation behavior of polynomials f + g, where f is a permutation over Fq of a given Carlitz rank, and g∈Fq[x] is of prescribed degree. The relation of this problem to the well-known Chowla–Zassenhaus conjecture is described. We also present some initial observations on the iterations of a permutation polynomial f∈Fq[x] and hence on the order of f as an element of the symmetric group S q .

Cite

CITATION STYLE

APA

Anbar, N., Odžak, A., Patel, V., Quoos, L., Somoza, A., & Topuzoğlu, A. (2018). On the Carlitz Rank of Permutation Polynomials Over Finite Fields: Recent Developments. In Association for Women in Mathematics Series (Vol. 11, pp. 39–55). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-319-74998-3_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free