Related papers: An irreducible class of polynomials over integers

Let $\S $ be an arbitrary subset of $R^n$ where $R$ is a domain with the field of fractions $\K$. Denote the ring of polynomials in $n$ variables over $\K$ by $\K[\x].$ The ring of integer-valued polynomials over $\S,$ denoted by…

We prove an irreducibility criterion for polynomials with power series coefficients generalizing previous known results concerning quasi-ordinary polynomials.

In this paper, a randomized algorithm for deciding the irreducibility of an irreducible polynomial and factoring a reducible polynomial over the field of rational numbers is presented. The main idea underlying the algorithm is based on…

Let GF(q), q=p^r, be a finite field with a primitive element g. In this paper we use exponential sums and Jacobi sums to compute the number of the irreducible polynomials of degree m over GF(q) with trace fixed and norm restricted to a…

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)…

We identify all non-splitting bi-unitary perfect polynomials over the field $\mathbb{F}_4$, which admit at most four irreducible divisors. There is an infinite number of such divisors.

Let $\mathbb{F}_q$ denote the finite field of $q$ elements and $\mathbb{F}_{q^n}$ the degree $n$ extension of $\mathbb{F}_q$. A normal basis of $\mathbb{F}_{q^n}$ over $\mathbb{F} _q$ is a basis of the form…

In this paper we prove that decomposable forms, or homogeneous polynomials $F(x_1, \cdots, x_n)$ with integer coefficients which split completely into linear factors over $\mathbb{C}$, take on infinitely many square-free values subject to…

We present the formula for the number of monic irreducible polynomials of degree $n$ over the finite field $\mathbb F_q$ where the coefficients of $x^{n-1}$ and $x$ vanish for $n\ge3$. In particular, we give a relation between rational…

A class of self-inversive polynomials includes all the self-reciprocal polynomials. Let A denote the set of all self-reciprocal polynomials with n+1 coefficients. Let B denote the set of certain self-inversive and non self-reciprocal…

We classify complete permutation polynomials of type $aX^{\frac{q^n-1}{q-1}+1}$ over the finite field with $q^n$ elements, for $n+1$ a prime and $n^4 < q$. For the case $n+1$ a power of the characteristic we study some known families. We…

We consider the question of certifying that a polynomial in ${\mathbb Z}[x]$ or ${\mathbb Q}[x]$ is irreducible. Knowing that a polynomial is irreducible lets us recognise that a quotient ring is actually a field extension (equiv.~that a…

The ring of integer-valued polynomials over a given subset $S$ of $\Z$ (or $ \mathrm{Int}(S,\Z ))$ is defined as the set of polynomials in $\Q[x]$ which maps $S$ to $\Z$. In factorization theory, it is crucial to check the irreducibility of…

We study the number of irreducible polynomials over $\mathbf{F}_{q}$ with some coefficients prescribed. Using the technique developed by Bourgain, we show that there is an irreducible polynomial of degree $n$ with $r$ coefficients…

This paper investigates whether or not polynomials that are irreducible over $\mathbb{Q}$ and $\mathbb{Z}$ can remain irreducible under substitution by all quadratic polynomials. It answers this question in the negative in the degree 2 and…

We count the number of irreducible polynomials in several variables of a given degree over a finite field. The results are expressed in terms of a generating series, an exact formula and an asymptotic approximation. We also consider the…

A polynomial with rational coefficients is said to be pure with respect to a rational prime $p$ if its Newton polygon has one slope. In this article, we prove that the number of irreducible factors of the $n$-th iterate of a pure polynomial…

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].

A polynomial $f(x)\in {\mathbb Z}[x]$ of degree $N$ is called \emph{monogenic} if $f(x)$ is irreducible over ${\mathbb Q}$ and $\{1,\theta,\theta^2,\ldots ,\theta^{N-1}\}$ is a basis for the ring of integers of ${\mathbb Q}(\theta)$, where…

Let $\mathbb F_q$ be the finite field with $q$ elements, where $q$ is a power of a prime. We discuss recursive methods for constructing irreducible polynomials over $\mathbb F_q$ of high degree using rational transformations. In particular,…