arXiv Analytics

Sign in

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.

Related articles: Most relevant | Search more
arXiv:1303.3937 [math.AC] (Published 2013-03-16, updated 2013-10-07)
Krull dimension and Monomial Orders
arXiv:0709.2978 [math.AC] (Published 2007-09-19, updated 2011-05-17)
The Groebner basis of the ideal of vanishing polynomials
arXiv:1907.12710 [math.AC] (Published 2019-07-30)
Depth of an initial ideal