Algorithm for the Grobner region of a principal ideal
Alexandru Bobe · 2006
Grobner basis theory is a fundamental tool of computational com- mutative algebra. The theory has been advanced by the introduction of techniques from combinatorics, polyhedral geometry and computational geometry. In particular, such techniques were used to create the con- cept of Grobner region for an ideal of a polynomial ring. The purpose of this paper is to present algoritms for computing the Grobner region of a principal ideal in two indeterminates, to implement in Singular (1) and also to visualize this object with Mathematica (2).