A Class of Permutation Binomials over Finite Fields
Xiang-dong Hou

TL;DR
This paper proves a conjecture characterizing when a specific class of permutation binomials over finite fields are permutations, based on parameters $t$ and the prime power $q$, confirming the precise conditions.
Contribution
The paper establishes necessary and sufficient conditions for a class of permutation binomials over finite fields, confirming a recent conjecture.
Findings
Confirmed the conjecture for permutation binomials over finite fields.
Identified exact conditions on parameters $t$ and $q$ for permutation behavior.
Provided a complete characterization of the permutation property for the class.
Abstract
Let be a prime power and , where . It was recently conjectured that is a permutation polynomial of if and only if one of the following holds: (i) , ; (ii) , ; (iii) , . We confirm this conjecture in the present paper.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Algebraic Geometry and Number Theory · Analytic Number Theory Research
