Permutation Polynomials of Fq2\Bbb F_{q^2} of the form aX+Xr(q−1)+1a{\tt X}+{\tt X}^{r(q-1)+1}

preprint2015arXivOpen access

Abstract

Let qq be a prime power, 2≤r≤q2\le r\le q, and f=aX+Xr(q−1)+1∈Fq2[X]f=a{\tt X}+{\tt X}^{r(q-1)+1}\in\Bbb F_{q^2}[{\tt X}], where a≠0a\ne 0. The conditions on r,q,ar,q,a that are necessary and sufficient for ff to be a permutation polynomial (PP) of Fq2{\Bbb F}_{q^2} are not known. (Such conditions are known under an additional assumption that aq+1=1a^{q+1}=1.) In this paper, we prove the following: (i) If ff is a PP of Fq2{\Bbb F}_{q^2}, then gcd(r,q+1)>1\text{gcd}(r,q+1)>1 and (−a)(q+1)/gcd(r,q+1)≠1(-a)^{(q+1)/\text{gcd}(r,q+1)}\ne 1. (ii) For a fixed r>2r>2 and subject to the conditions that q+1≡0(modr)q+1\equiv 0\pmod r and aq+1≠1a^{q+1}\ne 1, there are only finitely many (q,a)(q,a) for which ff is a PP of Fq2{\Bbb F}_{q^2}. Combining (i) and (ii) confirms a recent conjecture regarding the type of permutation binomial considered here.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.