Related papers: A Recursive Construction of Permutation Polynomial…

In this paper we propose a way to construct classical type Sobolev orthogonal polynomials. We consider two families of hypergeometric polynomials: ${}_2 F_2(-n,1;q,r;x)$ and ${}_3 F_2(-n,n-1+a+b,1;a,c;x)$ ($a,b,c,q,r>0$, $n=0,1,...$), which…

We show that many infinite classes of permutations over finite fields can be constructed via translators with a large choice of parameters. We first charac- terize some functions having linear translators, based on which several families of…

Permutation polynomials with few terms attracts researchers' interest in recent years due to their simple algebraic form and some additional extraordinary properties. In this paper, by analyzing the quadratic factors of a fifth-degree…

Up to linear transformations, we give a classification of all permutation polynomials of degree $7$ over $\mathbb{F}_{q}$ for any odd prime power $q$, with the help of the SageMath software.

In this note we prove a conjecture by Li, Qu, Li, and Fu on permutation trinomials over $\mathbb{F}_3^{2k}$. In addition, new examples and generalizations of some families of permutation polynomials of $\mathbb{F}_{3^k}$ and…

Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…

We give new formulas for Grothendieck polynomials of two types. One type expresses any specialization of a Grothendieck polynomial in at least two sets of variables as a linear combination of products Grothendieck polynomials in each set of…

Recently, there has been a lot of work on constructions of permutation polynomials of the form $(x^{2^m}+x+\delta)^{s}+x$ over the finite field $\F_{2^{2m}}$, especially in the case when $s$ is of the form $s=i(2^m-1)+1$ (Niho exponent). In…

In this paper, we get several new results on permutation polynomials over finite fields. First, by using the linear translator, we construct permutation polynomials of the forms $L(x)+\sum_{j=1}^k \gamma_jh_j(f_j(x))$ and…

Let $q=4$ and $k$ a positive integer. In this short note, we present a class of permutation polynomials over $\Bbb F_{q^{3k}}$. We also present a generalization.

We construct a class of permutation polynomials of $\bF_{2^m}$ that are closely related to Dickson polynomials.

In this work we establish some new interleavers based on permutation functions. The inverses of these interleavers are known over a finite field $\mathbb{F}_q$. For the first time M\"{o}bius and R\'edei functions are used to give new…

Combinatorial $t$-designs have nice applications in coding theory, finite geometries and several engineering areas. There are two major methods of constructing $t$-designs. One of them is via group actions of certain permutation groups…

Necessary and sufficient conditions on $A,B\in \mathbb{F}_{q^3}^*$ for $f(X)=X^{q^2-q+1}+AX^{q^2}+BX$ being a permutation polynomial of $\mathbb{F}_{q^3}$ are investigated via a connection with algebraic varieties over finite fields.

In the literature, there are many results about permutation polynomials over finite fields. However, very few permutations of vector spaces are constructed although it has been shown that permutations of vector spaces have many applications…

Let $f={\tt X}^r(a+{\tt X}^{2(q-1)})\in{\Bbb F}_{q^2}[{\tt X}]$, where $a\in{\Bbb F}_{q^2}^*$ and $r\ge 1$. The parameters $(q,r,a)$ for which $f$ is a permutation polynomial (PP) of ${\Bbb F}_{q^2}$ have been determined in the following…

Let $f(X)=X(1+aX^{q(q-1)}+bX^{2(q-1)})\in\Bbb F_{q^2}[X]$, where $a,b\in\Bbb F_{q^2}^*$. In a series of recent papers by several authors, sufficient conditions on $a$ and $b$ were found for $f$ to be a permutation polynomial (PP) of $\Bbb…

In this paper, we present several necessary conditions for the reversed Dickson polynomial $E_{n}(1, x)$ of the second kind to be a permutation of $\mathbb{F}_{q}$. In particular, we give explicit evaluation of the sum $\sum_{a\in…

For each prime power q, we determine all polynomials over F_{q^2} of the form f(X) := aX^{3q}+bX^{2q+1}+cX^{q+2}+dX^3 which induce complete mappings of F_{q^2}, in the sense that each of the functions x --> f(x) and x --> f(x)+x permutes…

We adapt (over $\mathbb{F}_2$) the general notions of multiplicative function, Dirichlet convolution and Inverse. We get some interesting results, namely necessary conditions for an odd binary polynomial to be perfect. Note that we are…