On the irreducible factors of a polynomial. II. (Q2178525)

In this paper, the authors give a lower bound for the degree of an irreducible factor of a given polynomial with integer coefficients. This bound is better than the earlier known bounds in this direction (see [\textit{A. Jakhar}, Proc. Am. Math. Soc. 148, No. 4, 1429--1437 (2020; Zbl 1446.12004)]). They have proved that if \(p\) is a prime number and \(f(x) = \sum\limits_{i=0}^{n}a_ix^i\) with \(a_0\neq 0\) is a polynomial with integer coefficients whose Newton polygon with respect to the prime \(p\) has \(\ell\) many edges with positive slopes \(\lambda_1, \dots, \lambda_{\ell},\) say \(\lambda_j = \frac{r_j}{s_j}\) with \(r_j, s_j\) coprime, then \(f(x)\) has an irreducible factor of degree at least \(\max_{1\leq j\leq \ell}\{s_j\}\) over \(\mathbb{Q}\). In fact this result is proved for polynomials with coefficients in arbitrary valued fields and the proof is based on results about residually transcendental prolongations proved in [\textit{S. K. Khanduja} and \textit{M. Kumar}, Manuscr. Math. 131, No. 3--4, 323--334 (2010; Zbl 1216.12007)]. The paper is well written and makes an interesting reading.