Related papers: Permutation and local permutation polynomial of ma…

Recently, Jiang et al. \cite{JIANG2025102522} obtained several classes of Permutation Polynomial of the form $x+\gamma\operatorname{Tr}_q^{q^2}(h(x))$ over finite fields $\mathbb{F}_{q^2},q=2^n$. In this paper, we find the compositional…

R. Gupta, P. Gahlyan and R.K. Sharma presented three classes of permutation trinomials over $\mathbb{F}_{q^3}$ in Finite Fields and Their Applications. In this paper, we employ the local method to prove that those polynomials are indeed…

We prove an analogue of the classical Bateman-Horn conjecture on prime values of polynomials for the ring of polynomials over a large finite field. Namely, given non-associate, irreducible, separable and monic (in the variable $x$)…

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…

In this paper we use algebraic curves and other algebraic number theory methods to show the validity of a permutation polynomial conjecture regarding $f(X)=X^{q(p-1)+1} +\alpha X^{pq}+X^{q+p-1}$, on finite fields $\mathbb{F}_{q^2}, q=p^k$,…

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…

In a recent paper Zhang et al. constructed 17 families of permutation pentanomials of the form $x^t+x^{r_1(q-1)+t}+x^{r_2(q-1)+t}+x^{r_3(q-1)+t}+x^{r_4(q-1)+t}$ over $\mathbb{F}_{q^2}$ where $q=2^m$. In this paper for 14 of these 17…

Let $K$ be a global field and $n > 1$ an integer. We show $n$ is composite if and only if there is an irreducible polynomial $f(x) \in K[x]$ of degree $n$ which is reducible $q$-adically for all the primes $q$ of $K$.

Let $q$ be a prime power, $2\le r\le q$, and $f=a{\tt X}+{\tt X}^{r(q-1)+1}\in\Bbb F_{q^2}[{\tt X}]$, where $a\ne 0$. The conditions on $r,q,a$ that are necessary and sufficient for $f$ to be a permutation polynomial (PP) of ${\Bbb…

For a finite field of odd number of elements we construct families of permutation binomials and permutation trinomials with one fixed-point (namely zero) and remaining elements being permuted as disjoint cycles of same length. Binomials and…

Motivated by coding applications,two enumeration problems are considered: the number of distinct divisors of a degree-m polynomial over F = GF(q), and the number of ways a polynomial can be written as a product of two polynomials of degree…

In this paper, we construct two classes of permutation polynomials over $\mathbb{F}_{q^2}$ with odd characteristic from rational R\'{e}dei functions. A complete characterization of their compositional inverses is also given. These…

We determine the minimal number of separating invariants for the invariant ring of a matrix group $G < \mathrm{GL}_n(\mathbb{F}_q)$ over the finite field $\mathbb{F}_q$. We show that this minimal number can be obtained with invariants of…

After a brief review of existing results on permutation binomials of finite fields, we introduce the notion of equivalence among permutation binomials (PBs) and describe how to bring a PB to its canonical form under equivalence. We then…

In 2019, Xiang Fan \cite{xfan} classified all permutation polynomials of degree $7$ over finite fields of odd characteristics. In this paper, we use this classification to determine the complete list of degree $7$ orthomorphism polynomials…

We determine all degree-4 rational functions f(X) in F_q(X) which permute P^1(F_q), and answer two questions of Ferraguti and Micheli about the number of such functions and the number of equivalence classes of such functions up to composing…

We establish expansion properties for suitably generic polynomials of degree $d$ in $d+1$ variables over finite fields. In particular, we show that if $P\in\mathbb{F}_q[x_1,\ldots,x_{d+1}]$ is a polynomial of degree $d$ coming from an…

In this paper, a computationally simple and explicit method of constructing recursive sequence of primitive polynomials of degree $n2^k (k = 1, 2, 3,\ldots)$ over $\mathbb{F}_{q}$ is given.

In this paper, a construction of complete permutation polynomials over finite fields of even characteristic proposed by Tu et al. recently is generalized in a recursive manner. Besides, several classes of complete permutation polynomials…

We construct explicitly in any finite field of the form Fq[x]/(x^m-a) elements with multiplicative order at least 2^{(2m)^(1/2)}