Irreducibility criterion, irreducible factors, Newton polygon techniques
Number Theory
2020-07-16 v1
Abstract
Jakhar shown that for () is a polynomial with rational coefficients, if there exists a prime integer satisfying and for every , then has at most irreducible factors over the field of rational numbers and each irreducible factor has degree at least . The goal of this paper is to generalize this criterion in the following context: Let be a rank one discrete valued field, its valuation ring and its residue field. Assume that , with for every , , and for some monic polynomial with is irreducible in . If for every , ,} then has at most irreducible factors over the field and so over and each irreducible factor has degree at least , where is the henselization of .
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}
}