2020/08/08 by Daniele Bartoli, Bartoli, Daniele, Xiang‐dong Hou +1
Computer Science · Engineering · Mathematics · #11R58 #11T06 #11T55 #14H05 #Coding theory and cryptography #FOS: Mathematics #Finite Group Theory Research #Number Theory (math.NT) #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.2008.03432
openalex publication_date 2020/08/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Let p be a prime and n be a positive integer, and consider fb(X)=X+(Xp-X+b)-1∈ \Bbb Fp(X), where b∈\Bbb Fpn is such that Trpn/p(b)≠ 0. It is known that (i) fb permutes \Bbb Fpn for p=2,3 and all n≥ 1; (ii) for p>3 and n=2, fb permutes \Bbb Fp2 if and only if Trp2/p(b)=± 1; and (iii) for p>3 and n≥ 5, fb does not permute \Bbb Fpn. It has been conjectured that for p>3 and n=3,4, fb does not permute \Bbb Fpn. We prove this conjecture for sufficiently large p.