Irreducibility criterion, irreducible factors, Newton polygon techniques

Abstract: Jakhar shown that for

f (x) = a_{n} x^{n} + a_{n - 1} x^{n - 1} + c d o t + a_{0}

(

a_{0} e q 0

) is a polynomial with rational coefficients, if there exists a prime integer

p

satisfying

u_{p} (a_{n}) = 0

and

n u_{p} (a_{i}) g e (n - i) u_{p} (a_{0}) > 0

for every

0 l e i l e n - 1

, then

f (x)

has at most

g c d (u_{p} (a_{0}), n)

irreducible factors over the field

m a t h b b Q

of rational numbers and each irreducible factor has degree at least

n / g c d (u_{p} (a_{0}), n)

. The goal of this paper is to generalize this criterion in the following context: Let

(K, u)

be a rank one discrete valued field,

R_{u}

its valuation ring and

m a t h b b F_{u}

its residue field. Assume that

f (x) = p h i^{n} (x) + a_{n - 1} (x) p h i^{n - 1} (x) + c d o t + a_{0} (x) i n R_{u} [x]

, with for every

i = 0, d o t s, n - 1

,

a_{i} (x) i n R_{u} [x]

, and

a_{0} (x) e q 0

for some monic polynomial

p h i i n R_{u} [x]

with

o v e r l i n e p h i

is irreducible in

m a t h b b F_{u} [x]

. If for every

0 l e i l e n - 1

,

n u_{p} (a_{i}) g e (n - i) u_{p} (a_{0}) > 0

,} then

f (x)

has at most

g c d (u_{p} (a_{0} (x)), n)

irreducible factors over the field

K^{h}

and so over

K

and each irreducible factor has degree at least

n / g c d (u_{p} (a_{0}), n)

, where

K^{h}

is the henselization of

(K, u)

.

This page was built for publication: Irreducibility criterion, irreducible factors, Newton polygon techniques