2000 character limit reached
A Class of Permutation Binomials over Finite Fields
Published 2 Oct 2012 in math.NT and math.CO | (1210.0881v1)
Abstract: Let $q>2$ be a prime power and $f={\tt x}{q-2}+t{\tt x}{q2-q-1}$, where $t\in\Bbb F_q*$. It was recently conjectured that $f$ is a permutation polynomial of $\Bbb F_{q2}$ if and only if one of the following holds: (i) $t=1$, $q\equiv 1\pmod 4$; (ii) $t=-3$, $q\equiv \pm1\pmod{12}$; (iii) $t=3$, $q\equiv -1\pmod 6$. We confirm this conjecture in the present paper.
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.