Irreducibility criterion, irreducible factors, Newton polygon techniques

Abstract

Jakhar shown that for f(x)=anxn + an-1xn-1+·+ a0 (a0≠ 0) is a polynomial with rational coefficients, if there exists a prime integer p satisfying p(an)=0 and np(ai) (n-i)p(a0)> 0 for every 0 i n-1, then f(x) has at most gcd(p(a0),n) irreducible factors over the field Q of rational numbers and each irreducible factor has degree at least n/gcd(p(a0),n). The goal of this paper is to generalize this criterion in the following context: Let (K,) be a rank one discrete valued field, R its valuation ring and F its residue field. Assume that f(x)=φn(x) + an- 1(x)φn-1(x)+·+ a0(x)∈ R[x], with for every i=0,…,n-1, ai(x)∈ R[x], and a0(x)≠ 0 for some monic polynomial φ∈ R[x] with φ is irreducible in F[x]. If for every 0 i n-1, np(ai) (n-i)p(a0)>0, then f(x) has at most gcd(p(a0(x)),n) irreducible factors over the field Kh and so over K and each irreducible factor has degree at least n/gcd(p(a0),n), where Kh is the henselization of (K,).

0

Discussion (0)

Sign in to join the discussion.

Loading comments…