On the difference between permutation polynomials over finite fields
Nurdag\"ul Anbar, Almasa Od\u{z}ak, Vandita Patel, Luciane Quoos, Anna, Somoza, Alev Topuzo\u{g}lu

TL;DR
This paper investigates the properties of permutation polynomials over finite fields, providing new lower bounds on the degree of certain polynomial differences based on Carlitz rank, extending previous non-existence and permutation results.
Contribution
It generalizes existing bounds on permutation polynomials by relating the degree of polynomial differences to Carlitz rank over arbitrary finite fields.
Findings
Lower bounds for degree of polynomial differences in terms of Carlitz rank.
Extension of previous non-existence results to broader classes of finite fields.
Specific bounds for permutation polynomials with certain structural properties.
Abstract
The well-known Chowla and Zassenhaus conjecture, proven by Cohen in 1990, states that if , then there is no complete mapping polynomial in of degree . For arbitrary finite fields , a similar non-existence result is obtained recently by I\c s\i k, Topuzo\u glu and Winterhof in terms of the Carlitz rank of . Cohen, Mullen and Shiue generalized the Chowla-Zassenhaus-Cohen Theorem significantly in 1995, by considering differences of permutation polynomials. More precisely, they showed that if and are both permutation polynomials of degree over , with , then the degree of satisfies , unless is constant. In this article, assuming and are permutation polynomials in , we give lower bounds for in terms of the Carlitz rank of and . Our…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Cooperative Communication and Network Coding · graph theory and CDMA systems
