Generating Integrally Indecomposable Newton Polygons with Arbitrary Many Vertices

Abstract

In this paper we shall give another proof of a special case of Gao’s theorem for generating integrally indecomposable polygons in the sense of Minkowski. The approach of proving this theorem will enable us to give an effective algorithm for construction integrally indecomposable convex integral polygons with arbitrary many vertices. In such a way, classes of absolute irreducible bivariate polynomials corresponding to those indecomposable Newton polygons are generated.