2000 character limit reached
Permutation Polynomials with Carlitz Rank 2
Published 10 Dec 2019 in math.NT | (1912.04653v2)
Abstract: Let $\mathbb{F}_q$ denote the finite field with $q$ elements. The Carlitz rank of a permutation polynomial is a important measure of complexity of the polynomial. In this paper we find the sharp lower bound for the weight of any permutation polynomial with Carlitz rank $2$, improving the bound found by G\'omez-P\'erez, Ostafe and Topuzo\u{g}lu in that case.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.