Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
401765 | Journal of Symbolic Computation | 2015 | 10 Pages |
Abstract
A well-known generalization of the notion of primitive polynomials over factorial domains to arbitrary commutative rings is analyzed and applied to triangular systems. In particular, we clarify when a triangular system generates its saturation ideal, thus correcting a criterion published first in 2008.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Gerhard Angermüller,