Related papers: Irreducibility of polynomials with a large gap

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

In this article, we propose a few sufficient conditions on polynomials having integer coefficients all of whose zeros lie outside a closed disc centered at the origin in the complex plane and deduce the irreducibility over the ring of…

For irreducible integer polynomials $f(n)=n^d+c$ we prove an asymptotic formula for the number of $k$-th power free values taken by $f(n)$, for $n$ running up to $x$, subject to the condition $k\ge (5d+3)/9$. This improves earlier results…

The Fibonacci polynomials are defined recursively as $f_{n}(x)=xf_{n-1}(x)+f_{n-2}(x)$, where $f_0(x) = 0$ and $f_1(x)= 1$. We generalize these polynomials to an arbitrary number of variables with the $r$-Fibonacci polynomial. We extend…

For a rational $q=u+\frac{\alpha}{d}$ with $u, \alpha, d\in \ACOBZ$ with $u\ge 0, 1\le \alpha<d$, $\gcd(\alpha, d)=1$, the \emph{generalized Hermite-Laguerre polynomials $G_q(x)$} are defined by \begin{align*} G_q(x)&=a_nx^n+a_{n-1}(\alpha…

Rings of integer-valued polynomials are known to be atomic, non-factorial rings furnishing examples for both irreducible elements for which all powers factor uniquely (\emph{absolutely irreducibles}) and irreducible elements where some…

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…

In this paper, we classify, up to three possible exceptions, all monic, post-critically finite quadratic polynomials $f(x)\in \mathbb{Z}[x]$ with an iterate reducible module every prime, but all of whose iterates are irreducible over…

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.

For a fixed quadratic irreducible polynomial $f$ with no fixed prime factors at prime arguments, we prove that there exist infinitely many primes $p$ such that $f(p)$ has at most 4 prime factors, improving a classical result of Richert who…

Given a polynomial P in several variables over an algebraically closed field, we show that except in some special cases that we fully describe, if one coefficient is allowed to vary, then the polynomial is irreducible for all but at most…

We investigate the computational complexity of deciding whether a given univariate integer polynomial p(x) has a factor q(x) satisfying specific additional constraints. When the only constraint imposed on q(x) is to have a degree smaller…

In this paper, we consider a variant of Tur\'an's problem on the distance from an integer polynomial in $\mathbb{Z}[x]$ to the nea\-rest irreducible polynomial in $\mathbb{Z}[x]$. We prove that for any polynomial $f \in \mathbb{Z}[x]$,…

We consider absolutely irreducible polynomials $f \in Z[x,y]$ with $\deg_x(f)=m$, $\deg_y(f)=n$ and height $H$. We show that for any prime $p$ with $p>c_{mn} H^{2mn+n-1}$ the reduction $f \bmod p$ is also absolutely irreducible. Furthermore…

For a fixed polynomial $\Delta$, we study the number of polynomials $f$ of degree $n$ over $\mathbb F_q$ such that $f$ and $f+\Delta$ are both irreducible, an $\mathbb F_q[T]$-analogue of the twin primes problem. In the large-$q$ limit, we…

In this paper we obtain new quantitative forms of Hilbert's Irreducibility Theorem. In particular, we show that if $f(X, T_1, \ldots, T_s)$ is an irreducible polynomial with integer coefficients, having Galois group $G$ over the function…

Let $R$ be a commutative ring with identity. An element $r \in R$ is said to be absolutely irreducible in $R$ if for all natural numbers $n>1$, $r^n$ has essentially only one factorization namely $r^n = r \cdots r$. If $r \in R$ is…

Let $f(x)=x^8+ax^4+b \in \mathbb{Q}[x]$ be an irreducible polynomial where $b$ is a square. We give a method that completely describes the factorization patterns of a linear resolvent of $f(x)$ using simple arithmetic conditions on $a$ and…

Cilleruelo conjectured that for an irreducible polynomial $f \in \mathbb{Z}[X]$ of degree $d \geq 2$, denoting $$L_f(N)=\mathrm{lcm}(f(1),f(2),\ldots f(N))$$ one has $$\log L_f(n)\sim(d-1)N\log N.$$ He proved it in the case $d=2$ but it…

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