Related papers: Families of polynomials and their specializations
We obtain explicit upper bounds for the number of irreducible factors for a class of compositions of polynomials in several variables over a given field. In particular, some irreducibility criteria are given for this class of compositions…
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…
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 give a formula and an estimation for the number of irreducible polynomials in two (or more) variables over a finite field.
The aim of the paper is to produce new families of irreducible polynomials, generalizing previous results in the area. One example of our general result is that for a near-separated polynomial, i.e., polynomials of the form…
We consider random polynomials with independent identically distributed coefficients with a fixed law. Assuming the Riemann hypothesis for Dedekind zeta functions, we prove that such polynomials are irreducible and their Galois groups…
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…
We present a more general proof that cyclotomic polynomials are irreducible over Q and other number fields that meet certain conditions. The proof provides a new perspective that ties together well-known results, as well as some new…
Let (K, v) be a henselian valued field of arbitrary rank. In this paper, we give an irreducibility criterion for multivariate polynomials over K using valuation theory.
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 this article, we prove some factorization results for several classes of polynomials having integer coefficients, which in particular yield several classes of irreducible polynomials. Such classes of polynomials are devised by imposing…
New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…
Let K be a number field, and let lambda(x,t)\in K[x, t] be irreducible over K(t). Using algebraic geometry and group theory, we study the set of alpha\in K for which the specialized polynomial lambda(x,alpha) is K-reducible. We apply this…
Limiting cases are studied of the Koornwinder-Macdonald multivariable generalization of the Askey-Wilson polynomials. We recover recently and not so recently introduced families of hypergeometric orthogonal polynomials in several variables…
In this article, we consider polynomials of the form $f(x)=a_0+a_{n_1}x^{n_1}+a_{n_2}x^{n_2}+\dots+a_{n_r}x^{n_r}\in \mathbb{Z}[x],$ where $|a_0|\ge |a_{n_1}|+\dots+|a_{n_r}|,$ $|a_0|$ is a prime power and $|a_0|\nmid |a_{n_1}a_{n_r}|$. We…
We present a theorem about irreducibility of a polynomial that is the resultant of two others polynomials. The proof of this fact is based on the field theory. We also consider the converse theorem and some examples.
Numerous results on self-reciprocal polynomials over finite fields have been studied. In this paper we generalize some of these to a-self reciprocal polynomials defined in [4]. We consider some properties of the divisibility of a-reciprocal…
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…
In this article, we give an account of some recent irreducibility testing criteria for polynomials having integer coefficients over the field of rational numbers.
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…