2000 character limit reached
on a conjecture on permutation rational functions over finite fields
Published 8 Aug 2020 in math.NT | (2008.03432v1)
Abstract: Let $p$ be a prime and $n$ be a positive integer, and consider $f_b(X)=X+(Xp-X+b){-1}\in \Bbb F_p(X)$, where $b\in\Bbb F_{pn}$ is such that $\text{Tr}{pn/p}(b)\ne 0$. It is known that (i) $f_b$ permutes $\Bbb F{pn}$ for $p=2,3$ and all $n\ge 1$; (ii) for $p>3$ and $n=2$, $f_b$ permutes $\Bbb F_{p2}$ if and only if $\text{Tr}{p2/p}(b)=\pm 1$; and (iii) for $p>3$ and $n\ge 5$, $f_b$ does not permute $\Bbb F{pn}$. It has been conjectured that for $p>3$ and $n=3,4$, $f_b$ does not permute $\Bbb F_{pn}$. We prove this conjecture for sufficiently large $p$.
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.