English

Irreducibility criterion, irreducible factors, Newton polygon techniques

Number Theory 2020-07-16 v1

Abstract

Jakhar shown that for f(x)=anxn+an1xn1++a0f(x)=a_nx^n + a_{n-1}x^{n-1}+\cdot+ a_0 (a00a_0\neq 0) is a polynomial with rational coefficients, if there exists a prime integer pp satisfying νp(an)=0\nu_p(a_n)=0 and nνp(ai)(ni)νp(a0)>0n\nu_p(a_i)\ge (n-i)\nu_p(a_0)> 0 for every 0in10\le i\le n-1, then f(x)f(x) has at most gcd(νp(a0),n)gcd(\nu_p(a_0),n) irreducible factors over the field Q\mathbb{Q} of rational numbers and each irreducible factor has degree at least n/gcd(νp(a0),n)n/gcd(\nu_p(a_0),n). The goal of this paper is to generalize this criterion in the following context: Let (K,ν)(K,\nu) be a rank one discrete valued field, RνR_\nu its valuation ring and Fν\mathbb{F}_\nu its residue field. Assume that f(x)=ϕn(x)+an1(x)ϕn1(x)++a0(x)Rν[x]f(x)=\phi^n(x) + a_{n- 1}(x)\phi^{n-1}(x)+\cdot+ a_0(x)\in R_\nu[x], with for every i=0,,n1i=0,\dots,n-1, ai(x)Rν[x]a_i(x)\in R_\nu[x], and a0(x)0a_0(x)\neq 0 for some monic polynomial ϕRν[x]\phi\in R_\nu[x] with ϕ\overline{\phi} is irreducible in Fν[x]\mathbb{F}_\nu[x]. If for every 0in10\le i\le n-1, nνp(ai)(ni)νp(a0)>0n\nu_p(a_i)\ge (n-i)\nu_p(a_0)>0,} then f(x)f(x) has at most gcd(νp(a0(x)),n)gcd(\nu_p(a_0(x)),n) irreducible factors over the field KhK^h and so over KK and each irreducible factor has degree at least n/gcd(νp(a0),n)n/gcd(\nu_p(a_0),n), where KhK^h is the henselization of (K,ν)(K,\nu).

Keywords

Cite

@article{arxiv.2007.07659,
  title  = {Irreducibility criterion, irreducible factors, Newton polygon techniques},
  author = {Lhoussain El Fadil},
  journal= {arXiv preprint arXiv:2007.07659},
  year   = {2020}
}