Reversed Dickson first-kind permutation polynomial classification

From papers

Let p>3p>3 be a prime, and let nn satisfy 1nleqp211\leq nleq p^2-1. Write Dn(1,x)D_n(1,x) for the reversed Dickson polynomial of the first kind. A polynomial that permutes Fp\mathbb{F}_p is called a permutation polynomial (PP). Reversed Dickson permutation conjecture. Dn(1,x)D_n(1,x) is a PP on Fp\mathbb{F}_p if and only if

n={2,2p,3,3p,p+1,p+2,2p+1if p1(mod12),2,2p,3,3p,p+1if p5(mod12),2,2p,3,3p,p+2,2p+1if p7(mod12),2,2p,3,3pif p11(mod12).n = \begin{cases} 2,2p,3,3p,p+1,p+2,2p+1 & \text{if } p\equiv 1 \pmod{12},\\ 2,2p,3,3p,p+1 & \text{if } p\equiv 5 \pmod{12},\\ 2,2p,3,3p,p+2,2p+1 & \text{if } p\equiv 7 \pmod{12},\\ 2,2p,3,3p & \text{if } p\equiv 11 \pmod{12}. \end{cases}

The stated indices are known to be sufficient, while necessity remains open in general; the cases p=5p=5 and p=7p=7 are proved in the paper.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Jiaqi Fang, Neranga Fernando and Haoming Wu, “Reversed Dickson polynomials”, arXiv:2307.06325 (2023).

Solutions 0

No solutions have been posted yet.