PreprintarXiv licencearXiv
Wendt's determinant and finiteness of prime characteristics for permutation binomials
Abstract
For f(X)=Xr(Xs+a)βπ½pm[X], with m,r,sgeqslant1 and aβπ½pmΓ, put g=gcd(s,pmβ1). We prove that, for each fixed g, only finitely many prime characteristics p admit such permutation binomials, even as m,r,s,a vary. If 6nmid g, every such p divides Wendt's determinant Wg=ResX(Xgβ1,(X+1)gβ1), which is nonzero. When 6| g, this determinant vanishes; inverse power sums and iterated resultants yield an explicit nonzero integer divisible by every such p>2g+1. We determine the exact admissible characteristics for 1leqslant gleqslant10, obtain a further divisibility condition over prime fields, and show that in prime fields g=11 occurs precisely when p=23.
Related
BibTeX
@misc{tang2026wendts,
title = {{Wendt's determinant and finiteness of prime characteristics for permutation binomials}},
author = {Zhichao Tang and Xiang Fan},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.18584},
eprint = {2610.18584},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.18584},
}
RIS
TY - UNPB
TI - Wendt's determinant and finiteness of prime characteristics for permutation binomials
AU - Zhichao Tang
AU - Xiang Fan
PY - 2026
DA - 2026/10/13
PB - arXiv
DO - 10.48550/arxiv.2610.18584
UR - https://arxiv.org/abs/2610.18584
AB - For f(X)=X^r(X^s+a)βπ½_p^m[X], with m,r,sgeqslant1 and aβπ½_p^m^Γ, put g=gcd(s,p^mβ1). We prove that, for each fixed g, only finitely many prime characteristics p admit such permutation binomials, even as m,r,s,a vary. If 6nmid g, every such p divides Wendt's determinant W_g=Res_X(X^gβ1,(X+1)^gβ1), which is nonzero. When 6| g, this determinant vanishes; inverse power sums and iterated resultants yield an explicit nonzero integer divisible by every such p>2g+1. We determine the exact admissible characteristics for 1leqslant gleqslant10, obtain a further divisibility condition over prime fields, and show that in prime fields g=11 occurs precisely when p=23.
ER -