Related papers: Factorization of Dickson polynomials over Finite F…

We prove an irreducibility criterion for polynomials of the form $h(x)=x^{2m} + bx^m + c_1 \in F[x]$ relating to the Dickson polynomials of the first kind $D_p$. In the case when $F = \mathbb{Q}$, $m$ is a prime $p>3$, and $c_1=c^p$, for…

We propose an algorithm for determining the irreducible polynomials over finite fields, based on the use of the companion matrix of polynomials and the generalized Jordan normal form of square matrices.

We show that a large multiplicative subgroup of a finite field $\mathbb{F}_q$ cannot be decomposed into $A+A$ or $A+B+C$ nontrivially. We also find new families of multiplicative subgroups that cannot be decomposed as the sum of two sets…

Let $\mathbb{F}_q$ be the finite field of $q$ elements, and let $k\mid q-1$ be a positive integer. Let $f(x)=ax^2+bx+c$ be a quadratic polynomial in $\mathbb{F}_q[x]$ with $b^2-4ac\ne0$. In this paper, we show that if…

The Schinzel hypothesis essentially claims that finitely many irreducible polynomials in one variable over Z simultaneously assume infinitely many prime values unless there is an obvious reason why this is impossible. We prove that under a…

For an odd prime power $q$ satisfying $q\equiv 1\pmod 3$ we construct totally $2(q-1) $ permutation polyomials, all giving involutory permutations with exactly $ 1+ \frac{q-1}3$ fixed points. Among them $(q-1)$ polynomials are trinomials,…

Designing a deterministic polynomial time algorithm for factoring univariate polynomials over finite fields remains a notorious open problem. In this paper, we present an unconditional deterministic algorithm that takes as input an…

By definition primitive and $2$-primitive elements of a finite field extension $\mathbb{F}_{q^n}$ have order $q^n-1$ and $(q^n-1)/2$, respectively. We have already shown that, with minor reservations, there exists a primitive element and a…

Let $q$ be an odd prime power and let $\F_q$ be the finite field with $q$ elements. Let $\mathcal{P}(n)$ be the set of monic irreducible polynomials of degree $n$ over $\mathbb{F}_q$. For $f=t^n+f_{n-1}t^{n-1}+\cdots+f_0\in\mathcal{P}(n)$,…

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.

Let $f=a{\tt x} +b{\tt x}^q+{\tt x}^{2q-1}\in\Bbb F_q[{\tt x}]$. We find explicit conditions on $a$ and $b$ that are necessary and sufficient for $f$ to be a permutation polynomial of $\Bbb F_{q^2}$. This result allows us to solve a related…

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 $\mathbb{F}_{q}$ be a finite field with $q$ elements and $\mathbb{F}_{q}[x]$ the ring of polynomials over $\mathbb{F}_{q}$. Let $l(x), k(x)$ be coprime polynomials in $\mathbb{F}_{q}[x]$ and $\Phi(k)$ the Euler function in…

We provide upper bounds on the total number of irreducible factors, and in particular irreducibility criteria for some classes of bivariate polynomials $f(x,y)$ over an arbitrary field $\mathbb{K}$. Our results rely on information on the…

We give necessary and sufficient conditions for a polynomial of the form x^r*(1+x^v+x^(2v)+...+x^(kv))^t to permute the elements of the finite field GF(q). Our results yield especially simple criteria in case (q-1)/gcd(q-1,v) is a small…

In this article we study the irreducibility of polynomials of the form $x^n+\epsilon_1 x^m+p^k\epsilon_2$, $p$ being a prime number. We will show that they are irreducible for $m=1$. We have also provided the cyclotomic factors and…

A special Infeld-Hall factorization is given for the Askey-Wilson second order q-difference operator. It is then shown how to deducd a generalization of the corresponding Askey-Wilson polynomials.

We introduce, characterise and provide a combinatorial interpretation for the so-called $q$-Jacobi-Stirling numbers. This study is motivated by their key role in the (reciprocal) expansion of any power of a second order $q$-differential…

In this article, we introduce and study the concept of the exponent of a cyclic code over a finite field $\mathbb{F}_q.$ We give a relation between the exponent of a cyclic code and its dual code. Finally, we introduce and determine the…

Given a polynomial with integral coefficients, one can inquire about the possible residues it can take in its image modulo a prime $p$. The sum over the distinct residues can sometimes be computed independent of the prime $p$; for example,…