arXiv:1707.00925 [math.AC]AbstractReferencesReviewsResources
Elimination via saturation
Mohamed Barakat, Markus Lange-Hegermann, Sebastian Posur
Published 2017-07-04Version 1
This short paper presents saturation-based algorithms for homogenization and elimination. Saturation can be computed using syzygies, hence the Gr\"obner-bases-driven algorithms work with respect to any monomial order, in particular, they do not require the use of block-elimination orders. The used saturation is a translation of the geometric fact that the projective cone of an affine scheme has no components in the hyperplane at infinity.
Categories: math.AC
Related articles: Most relevant | Search more
Krull dimension and Monomial Orders
The Groebner basis of the ideal of vanishing polynomials
arXiv:1907.12710 [math.AC] (Published 2019-07-30)
Depth of an initial ideal