Related papers: Irreducibility of integer-valued polynomials I

If K/k is a function field in one variable of positive characteristic, we describe a general algorithm to factor one-variable polynomials with coefficients in K. The algorithm is flexible enough to find factors subject to additional…

Let $\mathbb{F}_q$ be the finite field with $q$ elements, where $q$ is a prime power and $n$ be a positive integer. In this paper, we explore the factorization of $f(x^{n})$ over $\mathbb{F}_q$, where $f(x)$ is an irreducible polynomial…

Let $F$ be a field of $q$ elements, where $q$ is a power of an odd prime. Fix $n = (q+1)/2$. For each $s \in F$, we describe all the irreducible factors over $F$ of the polynomial $g_s(y): = y^n + (1-y)^n -s$, and we give a necessary and…

We provide an irreducibility test in the ring K[[x]][y] whose complexity is quasi-linear with respect to the valuation of the discriminant, assuming the input polynomial F square-free and K a perfect field of characteristic zero or greater…

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…

We investigate algebraic and arithmetic properties of a class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. In addition to divisibility and irreducibility results we also consider…

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\subseteq B$ be an extension of integral domains and $E$ a subset of the quotient field of $D$. We introduce the ring of \textit{$D$-valued $B$-rational functions on $E$}, denoted by $Int^R_B(E,D)$, which naturally extends the…

The classical Hilbert specialization property is a field-theoretic tool ensuring that polynomial irreducibility over a field is preserved under specialization of some of the variables. We develop an integral counterpart by introducing the…

We investigate $k$-superirreducible polynomials, by which we mean irreducible polynomials that remain irreducible under any polynomial substitution of positive degree at most $k$. Let $\mathbb F$ be a finite field of characteristic $p$. We…

The ring of integer-valued polynomials on an arbitrary integral domain is well-studied. In this paper we initiate and provide motivation for the study of integer-valued polynomials on commutative rings and modules. Several examples are…

Let $D$ be a commutative domain with field of fractions $K$ and let $A$ be a torsion-free $D$-algebra such that $A \cap K = D$. The ring of integer-valued polynomials on $A$ with coefficients in $K$ is ${\rm Int}_K(A) = \{f \in K[X] \mid…

We present counting methods for some special classes of multivariate polynomials over a finite field, namely the reducible ones, the s-powerful ones (divisible by the s-th power of a nonconstant polynomial), and the relatively irreducible…

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…

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

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…

We give an efficient algorithm to enumerate all sets of $r\ge 1$ quadratic polynomials over a finite field, which remain irreducible under iterations and compositions.

Let $V$ be a rank one valuation domain with quotient field $K$. We characterize the subsets $S$ of $V$ for which the ring of integer-valued polynomials ${\rm Int}(S,V)=\{f\in K[X] \mid f(S)\subseteq V\}$ is a Pr\"ufer domain. The…

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…

Let $R$ be a Dedekind ring, $K$ its quotient field, and $L=K(\alpha)$ a finite field extension of $K$ defined by a monic irreducible polynomial $f(x)\in R[x]$. We give an easy version of Dedekind's criterion which computationally improves…