Wendt's determinant and finiteness of prime characteristics for permutation binomials
Zhichao Tang, Xiang Fan
Abstract
For f(X)=Xr(Xs+a)∈ Fpm[X], with m,r,s≥slant1 and a∈ Fpm×, put g=(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 6 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 1≤slant g≤slant10, obtain a further divisibility condition over prime fields, and show that in prime fields g=11 occurs precisely when p=23.
Create a lesson
Related papers
Counting quaternion extensions by multi-heights
Willem Hansen
Geometric bounds on norms of signed indecomposable integers
Siu Hang Man, Zdeněk Pezlar, Pavlo Yatsyna
Linking numbers and special differential characters in arithmetic hyperbolic manifolds
Mads Bjerge Christensen
Some applications of the quasi-Riemann hypothesis to class groups and small generators of number fields
Christopher Frei, Efthymios Sofos, Martin Widmer
On Permutations Whose Adjacent-Sum Reciprocals Sum to One
Jinggao Ai, Dingsheng Hu, Junmin Yan
A Combinatorial Proof of Partition Identities for the Number of Distinct Part Sizes
Archit Agarwal, Meghali Garg