The degree of a polynomial is an important parameter in the study of numerous problems on
polynomials over finite fields. Recently, a new notion of the index of a polynomial over a …

Cyclotomic Mapping Permutation Polynomials over Finite Fields Page 1 Cyclotomic
Mapping Permutation Polynomials over Finite Fields Qiang Wang⋆ School of Mathematics …

In this paper, we survey on the recent results and methods in the study of compositional
inverses of permutation polynomials over finite fields. In particular, we describe a framework …

Latin squares and mutually orthogonal sets of Latin squares (MOLS) have an old history
predating Euler's work in the late 1700s. With the emergence of the abstract concept of a …

Permutation polynomials (PPs) and their inverses have applications in cryptography, coding
theory and combinatorial design theory. In this paper, we make a brief summary of the …

We use cyclotomy to construct new classes of permutation polynomials over finite fields. This
allows us to generate permutation polynomials in an algorithmic way and also to unify …

An involution over finite fields is a permutation polynomial whose inverse is itself. Owing to
this property, involutions over finite fields have been widely used in applications, such as …

This chapter focuses on the construction of the superstructure of CFST arch bridges, mainly
including the fabrication, welding and anti-corrosion coating of steel tube arch ribs, erection …

In this note, we give a shorter proof of the result of Zheng, Yu, and Pei on the explicit formula
of inverses of generalized cyclotomic permutation polynomials over finite fields. Moreover …

The study of computing compositional inverses of permutation polynomials over finite fields
efficiently is motivated by an open problem proposed by GL Mullen (1991), as well as the …