Related papers: Large classes of permutation polynomials over $\ma…
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 cryptography and coding theory. As far as we know,…
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 study degree preserving maps over the set of irreducible polynomials over a finite field. In particular, we show that every permutation of the set of irreducible polynomials of degree $k$ over $\mathbb{F}_q$ is induced by an action from…
The construction of permutation trinomials of the form $X^r(X^{\alpha (2^m-1)}+X^{\beta(2^m-1)} + 1)$ over $\F_{2^{2m}}$, where $m,~r\text{ and }\alpha > \beta$ are positive integers, is an active area of research. Several classes of…
Permutation polynomials with explicit constructions over finite fields have long been a topic of great interest in number theory. In recent years, by applying linear translators of functions from $\mathbb{F}_{q^n}$ to $\mathbb{F}_q$, many…
Permutation polynomials and their compositional inverses have wide applications in cryptography, coding theory, and combinatorial designs. Motivated by several previous results on finding compositional inverses of permutation polynomials of…
Let $\mathbb{F}_q$ be the finite field with $q$ elements, where $q$ is a prime power and $n$ be a positive integer. In this paper, we explore the factorization of $f(x^{n})$ over $\mathbb{F}_q$, where $f(x)$ is an irreducible polynomial…
In this paper, we construct a new class of complete permutation monomials and several classes of permutation polynomials. Further, by giving another characterization of o-polynomials, we obtain a class of permutation polynomials of the form…
We prove an asymptotic formula for the number of permutation for which the associated permutation polynomial has degree smaller than $q-2$.
We present new classes of permutation polynomials over finite fields.
In this paper, we prove that a binary definite quadratic form over F_q[t], where q is odd, is completely determined up to equivalence by the polynomials it represents up to degree 3m-2, where m is the degree of its discriminant. We also…
Finding functions, particularly permutations, with good differential properties has received a lot of attention due to their varied applications. For instance, in combinatorial design theory, a correspondence of perfect $c$-nonlinear…
We study trivariate permutation polynomials over $\mathbb{F}_{2^{m}}$ extending two APN permutation families of Li--Kaleyski (IEEE Trans. Inform. Theory, 2024) by allowing the scalar parameter to vary over $\mathbb{F}_{2^m}^*$. For \[…
Recently, Rathie and K{\i}l{\i}\c{c}man (2014) employed Kummer-type transformation for $_{2}F_{2}(a, d+1; b, d; x)$ to develop certain classes of expansions theorems for $_{2}F_{2}(x)$ hypergeometric polynomial. Our aim is to deduce…
In this paper, we present the compositional inverses of several classes permutation polynomials of the form $\sum_{i=1}^kb_i(x^{p^m}+x+\delta)^{s_i}-x$ over $\mathbb{F}_{p^{2m}}$, where for $1\leq i \leq k,$ $s_i, m$ are positive integers,…
The permutation groups of cyclic codes are widely applicable in determining the weight distribution of codes, decoding theory and various other areas. In this paper, by employing two distinct matrix representations, we can relate cyclic…
Let $q$ be a prime power. We construct stable polynomials of the form $b^{m-1}(x+a)^m+c(x+a)+d$ over a finite field $\mathbb{F}_{q}$ for $m=2,3,4$ by Capelli's lemma. When $m=3$ and $q$ is even, we confirm the conjecture of Ahmadi 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 describe and implement an algorithm to find all post-critically finite (PCF) cubic polynomials defined over $\mathbb{Q}$, up to conjugacy over $\text{PGL}_2(\bar{\mathbb{Q}})$. We describe normal forms that classify equivalence classes…
We prove a conjecture by Tu, Zeng, Li, and Helleseth concerning trinomials $f_{\alpha,\beta}(x)= x + \alpha x^{q(q-1)+1} + \beta x^{2(q-1)+1} \in \mathbb{F}_{q^2}[x]$, $\alpha\beta \neq 0$, $q$ even, characterizing all the pairs…