Complete mappings and Carlitz rank
Combinatorics
2016-04-27 v1
Abstract
The well-known Chowla and Zassenhaus conjecture, proven by Cohen in 1990, states that for any and any prime there is no complete mapping polynomial in of degree . For arbitrary finite fields , we give a similar result in terms of the Carlitz rank of a permutation polynomial rather than its degree. We prove that if , then there is no complete mapping in of Carlitz rank of small linearity. We also determine how far permutation polynomials of Carlitz rank are from being complete, by studying value sets of We provide examples of complete mappings if , which shows that the above bound cannot be improved in general.
Keywords
Cite
@article{arxiv.1604.07710,
title = {Complete mappings and Carlitz rank},
author = {Leyla Işık and Alev Topuzoğlu and Arne Winterhof},
journal= {arXiv preprint arXiv:1604.07710},
year = {2016}
}