Answers are grounded in this paper and cite their sources.
Let q be a prime power. We determine, for all positive integers e and r, the coefficients aqᵉ for which Xʳ(X2(q-1)+a) permutes Fqᵉ. For odd q and a≠0 there are no such permutations when e4 is even. Over Fq², with r unrestricted, the permutation binomials are characterized by congruence and coprimality conditions on r and equations of degree at most two for (-a)(q+1)/2, together with one sporadic family over F11²; this gives an explicit form of Hou's finiteness theorem for each fixed odd $r>3$. The remaining cases follow from the known classification for the exponent difference $q-1$. In the quadratic case, power sums whose binomial expansions are sparse by Lucas' theorem determine the exponent one p-adic digit at a time. In even degree at least four, an exponent congruence reduces the problem to the existence of a collision, which we obtain by counting norm ratios on the projective line. A power substitution extends the classification to Xʳ(Xd(q-1)+a) whenever (d,(qᵉ-1)/(q-1))=2.
No takes yet. Share an insight, caveat, or question.
Tang et al. (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: