pith. sign in

arxiv: 1604.07710 · v1 · pith:CQVSVXAInew · submitted 2016-04-26 · 🧮 math.CO

Complete mappings and Carlitz rank

classification 🧮 math.CO
keywords completecarlitzranklfloormathbbrfloordegreemapping
0
0 comments X
read the original abstract

The well-known Chowla and Zassenhaus conjecture, proven by Cohen in 1990, states that for any $d\ge 2$ and any prime $p>(d^2-3d+4)^2$ there is no complete mapping polynomial in $\mathbb{F}_{p}[x]$ of degree $d$. For arbitrary finite fields $\mathbb{F}_{q}$, we give a similar result in terms of the Carlitz rank of a permutation polynomial rather than its degree. We prove that if $n<\lfloor q/2\rfloor$, then there is no complete mapping in $\mathbb{F}_{q}[x]$ of Carlitz rank $n$ of small linearity. We also determine how far permutation polynomials $f$ of Carlitz rank $n<\lfloor q/2\rfloor$ are from being complete, by studying value sets of $f+x.$ We provide examples of complete mappings if $n=\lfloor q/2\rfloor$, which shows that the above bound cannot be improved in general.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.