Related papers: New Permutation Trinomials Constructed from Fracti…
Generalising the concept of a complete permutation polynomial over a finite field, we define completness to level $k$ for $k\ge1$ in fields of odd characteristic. We construct two families of polynomials that satisfy the condition of high…
Let F_{q^n} be the field of order q^n, and let Tr be the trace map from F_{q^n} to its q-element subfield. We exhibit nine sequences of polynomials of the form f(x):=x+c*Tr(x^k), with c in F_{q^n}, such that for each polynomial the function…
We construct a class of permutation polynomials of $\bF_{2^m}$ that are closely related to Dickson polynomials.
Up to linear transformations, we obtain a classification of permutation polynomials (PPs) of degree $8$ over $\mathbb{F}_{2^r}$ with $r>3$. By [J. Number Theory 176 (2017) 466-66], a polynomial $f$ of degree $8$ over $\mathbb{F}_{2^r}$ is…
We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…
This dissertation presents a multifaceted look into the structural decomposition of permutation classes. The theory of permutation patterns is a rich and varied field, and is a prime example of how an accessible and intuitive definition…
In this paper, we present the compositional inverses of several classes permutation polynomials of the form $\sum_{i=1}^kb_i\left({\rm Tr}_m^{mn}(x)^{t_i}+\delta\right)^{s_i}+f_1(x)$, where $1\leq i \leq k,$ $s_i$ are positive integers,…
We give historical remarks related to arXiv:2112.14547 ("A New Method of Construction of Permutation Trinomials with Coefficients 1", by Guo et al.). In particular, we show that the "new" permutation polynomials in that paper are actually…
In this paper, the compositional inverses of a class of linearized permutation polynomials of the form $P(x)=x+x^2+\tr(\frac{x}{a})$ over the finite field $\mathbb{F}_{2^n}$ for an odd positive integer $n$ are explicitly determined.
Let $\mu_{q+1}$ denote the set of $(q+1)$-th roots of unity in $\mathbb{F}_{q^2 }$. We construct permutation polynomials over $\mathbb{F}_{q^2}$ by using rational functions of any degree that induce bijections either on $\mu_{q+1}$ or…
The present paper deals with permutations induced by tame automorphisms over finite fields. The first main result is a formula for determining the sign of the permutation induced by a given elementary automorphism over a finite field. The…
A novel method for computation of the discrete Fourier transform over a finite field with reduced multiplicative complexity is described. If the number of multiplications is to be minimized, then the novel method for the finite field of…
The use of permutation polynomials has appeared, along to their compositional inverses, as a good choice in the implementation of cryptographic systems. Hence, there has been a demand for constructions of these polynomials which…
In this article, we give a complete description of the characteristic polynomials of supersingular abelian varieties over finite fields. We list them for the dimensions upto 7.
We introduce a new type of reduction of inversive difference polynomials that is associated with a partition of the basic set of automorphisms $\sigma$ and uses a generalization of the concept of effective order of a difference polynomial.…
A polynomial $f(x)$ over a field $K$ is called stable if all of its iterates are irreducible over $K$. In this paper we study the stability of trinomials over finite fields. Specially, we show that if $f(x)$ is a trinomial of even degree…
In this paper, several conjectures proposed in [2] are studied, involving the equivalence and duality of polycyclic codes associated with trinomials. According to the results, we give methods to construct isodual and self-dual polycyclic…
The sets of primitive, quasiprimitive, and innately transitive permutation groups may each be regarded as the building blocks of finite transitive permutation groups, and are analogues of composition factors for abstract finite groups. This…
Let $f=ax+x^{r(q-1)+1}\in \mathbb{F}_{q^2}^*[x], r\in \{5,7\}.$ We give explicit conditions on the values $(q,a)$ for which $f$ is a permutation polynomials of $\mathbb{F}_{q^2}.$
In this paper, by using the theory of circulant matrices we study some matrices over finite fields which involve the quadratic character and trinomial coefficients.