Related papers: A New Class of Irreducible Polynomials

We evaluate the number of monic polynomials (of arbitrary degree $N$) the zeros of which equal their coefficients when these are allowed to take arbitrary complex values. In the following, we call polynomials with this property {\em…

We study integer coefficient polynomials of fixed degree and maximum height $H$, that are irreducible by Dumas's criterion. We call such polynomials Dumas polynomials. We derive upper bounds on the number of Dumas polynomials, as $H$…

In this paper we investigate the factorization behaviour of the binomial polynomials $\binom{x}{n} = \frac{x(x-1)\cdots (x-n+1)}{n!}$ and their powers in the ring of integer-valued polynomials $\operatorname{Int}(\mathbb{Z})$. While it is…

Let $F$ be a number field, $O_F$ the integral closure of $\mathbb{Z}$ in $F$ and $P(T) \in O_F[T]$ a monic separable polynomial such that $P(0) \not=0$ and $P(1) \not=0$. We give precise sufficient conditions on a given positive integer $k$…

Let $f(x) \in \bbz[x]$ and consider the index divisibility set $D = \{n \in \bbn : n \mid f^n(0)\}$. We present a number of properties of $D$ in the case that $(f^n(0))_{n=1}^\infty$ is a rigid divisibility sequence, generalizing a number…

For a polynomial in several variables depending on some parameters, we discuss some results to the effect that for almost all values of the parameters the polynomial is irreducible. In particular we recast in this perspective some results…

For a given set of integers $\mathcal{S}$, let $\mathcal{R}_n^*(\mathcal{S})$ denote the set of reducible polynomials $f(X)=a_nX^n+a_{n-1}X^{n-1}+\cdots+a_1X+a_0$ over $\mathbb{Z}[X]$ with $a_i\in\mathcal{S}$ and $a_0a_n\ne 0$. In this…

We describe a congruence property of solvable polynomials over Q, based on the irreducibility of cyclotomic polynomials over number fields that meet certain conditions.

We study a random polynomial of degree $n$ over the finite field $\mathbb{F}_q$, where the coefficients are independent and identically distributed and uniformly chosen from the squares in $\mathbb{F}_q$. Our main result demonstrates that…

In this article we study asymptotic behavior of the probability that a random monic polynomial with integer coefficients is irreducible over the integers. We consider the cases where the coefficients grow together with the degree of the…

In this paper we give elementary conditions completely characterising when the theory of modules of a Pr\"ufer domain is decidable. Using these results, we show that the theory of modules of the ring of integer valued polynomials is…

We introduce a new family of orthogonal polynomials on the disk that has emerged in the context of wave propagation in layered media. Unlike known examples, the polynomials are orthogonal with respect to a measure all of whose even moments…

Let $R(x)=g(x)/h(x)$ be a rational expression of degree three over the finite field $\mathbb{F}_q$. We count the irreducible polynomials in $\mathbb{F}_q[x]$, of a given degree, which have the form $h(x)^{\mathrm{deg}\, f}\cdot…

Classifications of irreducible components of the set of polynomial differential equations with a fixed degree and with at least one center singularity lead to some other new problems on Picard-Lefschetz theory and Brieskorn modules of…

The absolute separation of a polynomial is the minimum nonzero difference between the absolute values of its roots. In the case of polynomials with integer coefficients, it can be bounded from below in terms of the degree and the height…

For a set $S$ of quadratic polynomials over a finite field, let $C$ be the (infinite) set of arbitrary compositions of elements in $S$. In this paper we show that there are examples with arbitrarily large $S$ such that every polynomial in…

We present a sufficient condition for a self-inversive polynomial to have a fixed number of roots on the complex unit circle. We also prove that these roots are simple when that condition is satisfied. This generalizes the condition found…

We present a sufficient condition for irreducibility of forcing algebras and study the (non)-reducedness phenomenon. Furthermore, we prove a criterion for normality for forcing algebras over a polynomial base ring with coefficients in a…

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…

In an earlier paper we showed that we can improve results by Emmy Noether and Alexander Ostrowski concerning the reducibility modulo p of absolutely irreducible polynomials with integer coefficients by giving the problem a geometric turn…