2000 character limit reached
On a conjecture on permutation polynomials over finite fields
Published 29 Jun 2018 in math.NT | (1806.11473v1)
Abstract: Let $\Bbb F_q$ be the finite field with $q$ elements and let $p=\text{char}\,\Bbb F_q$. It was conjectured that for integers $e\ge 2$ and $1\le a\le pe-2$, the polynomial $X{q-2}+X{q2-2}+\cdots+X{qa-2}$ is a permutation polynomial of $\Bbb F_{qe}$ if and only if (i) $a=2$ and $q=2$, or (ii) $a=1$ and $\text{gcd}(q-2,qe-1)=1$. In the present paper we confirm this conjecture.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.