A characteristic pair is a pair (G, C) of polynomial sets in which G is a reduced lexicographic Gröbner basis, C is the minimal triangular set contained in G, and C is normal. In this paper, we show that any finite polynomial set P can be decomposed algorithmically into finitely many characteristic pairs with associated zero relations, which provide representations for the zero set of P in terms of those of Gröbner bases and those of triangular sets. The algorithm we propose for the decomposition makes use of the inherent connection between Ritt characteristic sets and lexicographic Gröbner bases and is based essentially on the structural properties and the computation of lexicographic Gröbner bases. Several nice properties about the decomposition and the resulting characteristic pairs, in particular relationships between the Gröbner basis and the triangular set in each pair, are established. Examples are given to illustrate the algorithm and some of the properties.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.