Related papers: Further Results on Permutation Polynomials over Fi…

Let $r$ be a positive integer, $h(X)\in\Bbb F_{q^2}[X]$, and $\mu_{q+1}$ be the subgroup of order $q+1$ of $\Bbb F_{q^2}^*$. It is well known that $X^rh(X^{q-1})$ permutes $\Bbb F_{q^2}$ if and only if $\text{gcd}(r,q-1)=1$ and…

We show the existence of and explicitly construct generic polynomials for various groups, over fields of positive characteristic. The methods we develop apply to a broad class of connected linear algebraic groups defined over finite fields…

This paper provides an algorithmic generalization of Dickson's method of classifying permutation polynomials (PPs) of a given degree $d$ over finite fields. Dickson's idea is to formulate from Hermite's criterion several polynomial…

In this paper, we study properties of polynomials over division rings. Moreover, we present formulas for finding roots of some polynomials

Let $q$ be a prime power and $\mathbb F_{q^n}$ be the finite field with $q^n$ elements, where $n>1$. We introduce the class of the linearized polynomials $L(x)$ over $\mathbb F_{q^n}$ such that…

In this paper, as an analogue of the integer case, we study detailedly the period and the rank of the generalized Fibonacci sequence of polynomials over a finite field modulo an arbitrary polynomial. We establish some formulas to compute…

Let $\mathbb{F}_q$ be a finite field. Given two irreducible polynomials $f,g$ over $\mathbb{F}_q$, with $\mathrm{deg} f$ dividing $\mathrm{deg} g$, the finite field embedding problem asks to compute an explicit description of a field…

We consider various counting questions for irreducible binomials over finite fields. We use various results from analytic number theory to investigate these questions.

We obtain new upper bounds on the number of distinct roots of lacunary polynomials over finite fields. Our focus will be on polynomials for which there is a large gap between consecutive exponents in the monomial expansion.

An efficient evaluation method is described for polynomials in finite fields. Its complexity is shown to be lower than that of standard techniques when the degree of the polynomial is large enough. Applications to the syndrome computation…

We study the explicit factorization of $2^n r$-th cyclotomic polynomials over finite field $\mathbb{F}_q$ where $q, r$ are odd with $(r, q) =1$. We show that all irreducible factors of $2^n r$-th cyclotomic polynomials can be obtained…

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.

In this note, we prove multiplicity one theorems for generalized modular functions (GMF), in terms of their q-exponents, and make a general statement about the nature of values that the prime q-exponents of a GMF can take. We shall also…

In this paper we introduce a new approach and obtain new results for the problem of studying polynomial images of affine subspaces of finite fields. We improve and generalise several previous known results, and also extend the range of such…

Let $\mathbb F_q$ be the finite field with $q$ elements, $f, g\in \mathbb F_q[x]$ be polynomials of degree at least one. This paper deals with the asymptotic growth of certain arithmetic functions associated to the factorization of the…

We study the properties of different type of transforms by means of operational methods and discuss the relevant interplay with many families of special functions. We consider in particular the binomial transform and its generalizations. A…

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…

Some properties and relations satisfied by the polynomial solutions of a bispectral problem are studied. Given a finite order differential operator, under certain restrictions, its polynomial eigenfunctions are explicitly obtained, as well…

Using arbitrary bases for the finite field $\mathbb{F}_{q^n}$ over $\mathbb{F}_{q}$, we obtain the generalized M\"obius transformations (GMTs), which are a class of bijections between the projective geometry $PG(n-1,q)$ and the set of roots…

Given a finite field $\F_q$ and $n\in \N^*$, one could try to compute all polynomial endomorphisms $\F_q^n\lp \F_q^n$ up to a certain degree with a specific property. We consider the case $n=3$. If the degree is low (like 2,3, or 4) and the…