Related papers: Irreducibility of integer-valued polynomials in se…

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…

A computable ring is a ring equipped with mechanical procedure to add and multiply elements. In most natural computable integral domains, there is a computational procedure to determine if a given element is prime/irreducible. However,…

Let $(K,\nu)$ be an arbitrary valued field with valuation ring $R_{\nu}$ and $L=K(\alpha)$, where $\alpha$ is a root of a monic irreducible polynomial $f\in R_{\nu}[x]$. In this paper, we characterize the integral closedness of…

Let $q$ be a power of a prime, let $\mathbb{F}_q$ be the finite field with $q$ elements and let $n \geq 2$. For a polynomial $h(x) \in \mathbb{F}_q[x]$ of degree $n \in \mathbb{N}$ and a subset $W \subseteq [0,n] := \{0, 1, \ldots, n\}$, we…

Let $S$ be a subset of $\overline{\mathbb Z}$, the ring of all algebraic integers. A polynomial $f \in \mathbb Q[X]$ is said to be integral-valued on $S$ if $f(s) \in \overline{\mathbb Z}$ for all $s \in S$. The set $\text{Int}_{\mathbb…

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…

Given a certain factorization property of a ring $R$, we can ask if this property extends to the polynomial ring over $R$ or vice versa. For example, it is well known that $R$ is a unique factorization domain if and only if $R[X]$ is a…

In this article, we give two different sufficient conditions for the irreducibility of a polynomial of more than one variable, over the field of complex numbers, that can be written as a sum of two polynomials which depend on mutually…

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…

Let $F$ be a field, $p$ a prime number, $X$ an indeterminate over $F$, $D_n =F[X^{\frac{1}{p^n}}, X^{-\frac{1}{p^n}}]$ for each integer $n \geq 0$ and $D = \bigcup\limits_{n\in\mathbb{N}_0}D_n.$ Then $D$ is a one-dimensional B{\'e}zout…

In this paper, we obtain several new factorization results for certain classes of polynomials having integer coefficients. In doing so, we use the information about prime factorization of the value taken up by such polynomials and their…

We show that for a random polynomial \[ F(X) = \sum_{n=1}^{N} f(n) X^{n-1}, \] where $f(n)$ is a random completely multiplicative function taking values in $\{\pm 1\}$, one has \[ \limsup_{N \to \infty} \mathbb{P}\big[F(X) \text{ is…

We prove first-order definability of the prime subring inside polynomial rings, whose coefficient rings are (commutative unital) reduced and indecomposable. This is achieved by means of a uniform formula in the language of rings with…

Let $K$ be a number field of degree $n$ with ring of integers $O_K$. By means of a criterion of Gilmer for polynomially dense subsets of the ring of integers of a number field, we show that, if $h\in K[X]$ maps every element of $O_K$ of…

We study the class of univariate polynomials $\beta_k(X)$, introduced by Carlitz, with coefficients in the algebraic function field $\mathbb F_q(t)$ over the finite field $\mathbb F_q$ with $q$ elements. It is implicit in the work of…

A polynomial with coefficients in the ring of integers $\mathcal{O}_{K}$ of a global field $K$ is called intersective if it has a root modulo every finite-indexed subgroup of $\mathcal{O}_{K}$. We prove two criteria for a polynomial…

We establish necessary and sufficient conditions for a quadratic polynomial to be irreducible in the ring $Z[[x]]$ of formal power series with integer coefficients. For $n,m\ge 1$ and $p$ prime, we show that $p^n+p^m\beta x+\alpha x^2$ is…

Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…

Let $D$ be a Krull domain admitting a prime element with finite residue field and let $K$ be its quotient field. We show that for all positive integers $k$ and $1 < n_1 \leq \ldots \leq n_k$ there exists an integer-valued polynomial on $D$,…

Let $R$ be a factorial domain. In this work we investigate the connections between the arithmetic of ${\rm Int}(R)$ (i.e., the ring of integer-valued polynomials over $R$) and its monadic submonoids (i.e., monoids of the form $\{g\in {\rm…