Papers
Topics
Authors
Recent
Search
2000 character limit reached

Complete mappings and Carlitz rank

Published 26 Apr 2016 in math.CO | (1604.07710v1)

Abstract: The well-known Chowla and Zassenhaus conjecture, proven by Cohen in 1990, states that for any $d\ge 2$ and any prime $p>(d2-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.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.