On a conjecture on permutation polynomials over finite fields
Wun-Seng Chou, Xiang-dong Hou

TL;DR
This paper confirms a conjecture regarding specific permutation polynomials over finite fields, establishing precise conditions under which these polynomials permute the elements of the field.
Contribution
The paper proves the conjecture that characterizes when certain sums of monomials form permutation polynomials over finite fields.
Findings
Confirmed the conjecture for all cases.
Identified conditions for permutation behavior.
Provided a complete characterization of the polynomials.
Abstract
Let be the finite field with elements and let . It was conjectured that for integers and , the polynomial is a permutation polynomial of if and only if (i) and , or (ii) and . In the present paper we confirm this conjecture.
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 · graph theory and CDMA systems · Finite Group Theory Research
