English

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 d2d\ge 2 and any prime p>(d23d+4)2p>(d^2-3d+4)^2 there is no complete mapping polynomial in Fp[x]\mathbb{F}_{p}[x] of degree dd. For arbitrary finite fields Fq\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<q/2n<\lfloor q/2\rfloor, then there is no complete mapping in Fq[x]\mathbb{F}_{q}[x] of Carlitz rank nn of small linearity. We also determine how far permutation polynomials ff of Carlitz rank n<q/2n<\lfloor q/2\rfloor are from being complete, by studying value sets of f+x.f+x. We provide examples of complete mappings if n=q/2n=\lfloor q/2\rfloor, 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}
}
R2 v1 2026-06-22T13:41:20.903Z