A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Multiplicity-preserving triangular set decomposition of two polynomials
2014
Journal of Systems Science and Complexity
In this paper, a multiplicity-preserving triangular set decomposition algorithm is proposed for a system of two polynomials, which involves only computing the primitive polynomial remainder sequence of two polynomials once and certain GCD computations. The algorithm decomposes the unmixed variety defined by two polynomials into square free and disjoint (for non-vertical components, see Definition 4) algebraic cycles represented by triangular sets, which may have negative multiplicities. Thus,
doi:10.1007/s11424-014-2017-0
fatcat:22ueextldjfylgs4ftxdx7sriu