Related papers: Divisibility of Trinomials by Irreducible Polynomi…

In this article, we consider the polynomials of the form $f(x)=a_0+a_1x+a_2x^2+\cdots+a_nx^n\in \mathbb{Z}[x],$ where $|a_0|=|a_1|+\dots+|a_n|$ and $|a_0|$ is a prime. We show that these polynomials have a cyclotomic factor whenever…

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…

Swan (Pacific J. Math. 12(3) (1962), 1099-1106) characterized the parity of the number of irreducible factors of trinomials over $F_2$. Many researchers have recently obtained Swan-like results on determining the reducibility of polynomials…

In this article, we consider polynomials of the form $f(x)=a_0+a_{n_1}x^{n_1}+a_{n_2}x^{n_2}+\dots+a_{n_r}x^{n_r}\in \mathbb{Z}[x],$ where $|a_0|\ge |a_{n_1}|+\dots+|a_{n_r}|,$ $|a_0|$ is a prime power and $|a_0|\nmid |a_{n_1}a_{n_r}|$. We…

Divisibility of trinomials by given polynomials over finite fields has been studied and used to construct orthogonal arrays in recent literature. Dewar et al.\ (Des.\ Codes Cryptogr.\ 45:1-17, 2007) studied the division of trinomials by a…

We give a lower bound for the degree of an irreducible factor of a given polynomial. This improves and generalizes the results obtained in [4, On the irreducible factors of a polynomial, Proc. Amer. Math. Soc., 148 (2020] 1429 -- 1437].

We obtain explicit upper bounds for the number of irreducible factors for a class of compositions of polynomials in several variables over a given field. In particular, some irreducibility criteria are given for this class of compositions…

Let $a,b,c$ be non-zero integers and $f(x)=ax^n+bx^m+c$ be a trinomial of degree $n$. We surveyed the irreducibility criteria of $f(x)$ over rational numbers.

Numerous results on self-reciprocal polynomials over finite fields have been studied. In this paper we generalize some of these to a-self reciprocal polynomials defined in [4]. We consider some properties of the divisibility of a-reciprocal…

We obtain various irreducibility criteria for pairs of polynomials $(f(X),g(X))$ with integer coefficients whose resultant $Res(f,g)$ is a prime number, or is divisible by a sufficiently large prime number, and also for some of their linear…

We prove that, over a field of characteristic $0$, the degrees of factors of a binomial $t^n-\alpha$ are divisible by the least such degree. As a consequence, we deduce that for relatively prime natural numbers $m,n$, a polynomial has the…

In this paper we consider in detail the composition of an irreducible polynomial with X^2 and suggest a recurrent construction of irreducible polynomials of fixed degree over finite fields of odd characteristics. More precisely, given an…

The famous irreducibility criteria of Sch\"onemann-Eisenstein and Dumas rely on information on the divisibility of the coefficients of a polynomial by a single prime number. In this paper we provide several irreducibility criteria of…

Say a trinomial $x^n+A x^m+B \in \Q[x]$ has reducibility type $(n_1,n_2,...,n_k)$ if there exists a factorization of the trinomial into irreducible polynomials in $\Q[x]$ of degrees $n_1$, $n_2$,...,$n_k$, ordered so that $n_1 \leq n_2 \leq…

We give all bi-unitary non splitting even perfect polynomials over the prime field of two elements, which are divisible by Mersenne irreducible polynomials raised to special exponents. We also identify all bi-unitary perfect polynomials…

The following result, a consequence of Dumas criterion for irreducibility of polynomials over integers, is generally proved using the notion of Newton diagram: Let $f(x)$ be a polynomial with integer coefficients and $k$ be a positive…

In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we…

Let $f(x) = \sum\limits _{i=0}^{n} a_i x^i $ be a polynomial with coefficients from the ring $\mathbb{Z}$ of integers satisfying either $(i)$ $0 < a_0 \leq a_{1} \leq \cdots \leq a_{k-1} < a_{k} < a_{k+1} \leq \cdots \leq a_n$ for some $k$,…

A method for generating irreducible polynomials of degree n over the finite field GF(2) is proposed. The irreducible polynomials are found by solving a system of equations that brings the information on the internal properties of the…

In this paper we obtained the formula for the number of irreducible polynomials with degree $n$ over finite fields of characteristic two with given trace and subtrace. This formula is a generalization of the result of Cattell et al.(2003)…