Permutation polynomials and their compositional inverses
This paper provides a new general method for finding the compositional inverses of special permutation polynomials (PPs). The method is based on the AGW method of Akbrary et al. and a generalization of this by Niu et al. and PZ Yuan. Some families of PPs of the form \(x^rh(x^s)\), where \(s\) divides \(q-1\), and their compositional inverses are given. Moreover, the group structure of these PPs is determined.\N\NSection 1 and Section 2 are dedicated to an introduction and some preliminaries which are used in the subsequent sections. The Section 2 is a short preliminary-section dedicated to AGW criterion which is a characterization of bijections (permutations) over finite sets (Lemma 2.1), and the definitions of semidirect and wreath products. In Section 3, the authors determine the group structure of PPs with some special properties. The authors show that these PPs constitute a group under composition and this group is isomorphic to a generalized wreath product (Theorem 3.1), which is by definition a special semidirect product. The main result of the paper appears in Section 4. In this section, the authors present a general method of finding the compositional inverses of the families of PPs studied in Section 3. Proposition 4.1 provides necessary and sufficient conditions for a bijection over finite sets, as well as necessary conditions for its inverse. Some consequences of these results are provided in Corollaries 4.2 and 4.3. In Section 5, the larger section, applications are provided by showing some new PPs (Theorem 5.5) and their compositional inverse (Theorem 5.6) over a particular finite field. The article ends with some concluding remarks in section 6.
This page was built for publication: Permutation polynomials and their compositional inverses
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6972277)
