Indexed metadata

Wendt's determinant and finiteness of prime characteristics for permutation binomials

Zhichao Tang, Xiang Fan

Source record

Source: arXiv

Published: Oct 13, 2026

arXiv: 2610.18584

Open original source ↗

Source abstract

For f(X)=Xr(Xs+a)∈Fpm[X]f(X)=X^r(X^s+a)\in\mathbb F_{p^m}[X], with m,r,s⩾1m,r,s\geqslant1 and a∈Fpm×a\in\mathbb F_{p^m}^\times, put g=gcd⁡(s,pm−1)g=\gcd(s,p^m-1). We prove that, for each fixed gg, only finitely many prime characteristics pp admit such permutation binomials, even as m,r,s,am,r,s,a vary. If 6∤g6\nmid g, every such pp divides Wendt's determinant Wg=Res⁡X(Xg−1,(X+1)g−1)W_g=\operatorname{Res}_X(X^g-1,(X+1)^g-1), which is nonzero. When 6∣g6\mid g, this determinant vanishes; inverse power sums and iterated resultants yield an explicit nonzero integer divisible by every such p>2g+1p>2g+1. We determine the exact admissible characteristics for 1⩽g⩽101\leqslant g\leqslant10, obtain a further divisibility condition over prime fields, and show that in prime fields g=11g=11 occurs precisely when p=23p=23.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

Wendt's determinant and finiteness of prime characteristics for permutation binomials — Mathematical Frontier Network