No label defined (Q4370133)

The paper firstly gives a short historical review of Eisenstein--type irreducibility criteria for univariate polynomials. Then, the author proposes to resurrect the use of Newton polygons to deal with polynomial factorization and irreducibility. He gives new detailed proofs of some old irreducibility criteria, mainly due to \textit{G. Dumas} [J. Math. Pures Appl. (6) 2, 191-258 (1906; JFM 37.0096.01)] and \textit{O. Perron }[Math. Ann. 60, 448-458 (1905; JFM 36.0123.01)], providing several examples and some interesting historical and technical observations. Finally, some new results are obtained and they are used to prove the irreducibility of some trinomials of the form \(X^n+aX+b\), where \(a\) and \(b\) are equal to \(1\) or \(2\); furthermore, it is shown that the use of Newton polygons could be very useful in testing irreducibility of a polynomial \(f\) when one knows by other means that \(f\) has no irreducible quadratic (or cubic, etc.) factors. For the entire collection see [Zbl 0872.00033].