A characteristic-prime criterion for complete permutation monomials

From papers

Let pp be an odd prime, let n+1=pn+1=p, and set

d=pnk1pk1+1.d=\frac{p^{nk}-1}{p^k-1}+1.

Let aFpnka\in\mathbb{F}_{p^{nk}}^* satisfy apk1=1a^{p^k-1}=-1. Complete permutation monomial conjecture. The monomial a1xda^{-1}x^d is a complete permutation polynomial over Fpnk\mathbb{F}_{p^{nk}}. The source reports that this conjecture was proven in odd characteristic, so it is recorded as solved.

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

Xiutao Feng, Dongdai Lin, Liping Wang and Qiang Wang, “Further results on complete permutation monomials over finite fields”, arXiv:1708.06955 (2017).

Solutions 0

No solutions have been posted yet.