Extending a result of Carlitz and McConnel to polynomials which are not permutations
Bence Csajb\'ok

TL;DR
This paper extends a classical result on polynomials over finite fields, showing that under certain conditions on the directions determined by the polynomial's graph, the polynomial must be a permutation of the field.
Contribution
It proves a new criterion involving the set of directions and their ratios, confirming Sziklai's conjecture in broader cases beyond permutations.
Findings
If the set of ratios of directions is small, then the polynomial is a permutation.
The paper verifies Sziklai's conjecture for a wider class of polynomials.
Provides a new permutation criterion based on direction sets and their ratios.
Abstract
Let denote the set of directions determined by the graph of a polynomial of , where is a power of the prime . If is contained in a multiplicative subgroup of , then by a result of Carlitz and McConnel it follows that for some . Of course, if , then and hence is a permutation. If we assume the weaker condition , then is not necessarily a permutation, but Sziklai conjectured that follows also in this case. When is odd, and the index of is even, then a result of Ball, Blokhuis, Brouwer, Storme and Sz\H onyi combined with a result of McGuire and G\"olo\u{g}lu proves the conjecture. Assume . We prove that if the size of is less than $q-\deg…
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
TopicsAdvanced Mathematical Identities · Advanced Combinatorial Mathematics · Mathematical functions and polynomials
