Elimination via saturation
Commutative Algebra
2020-07-09 v3
Abstract
This short paper presents saturation-based algorithms for homogenization and elimination. This algorithm can compute elimination ideals by using syzygies and ideal membership test, hence it works with any} monomial order, in particular without the use of block-elimination orders. The used saturation is a translation of the geometric fact that the projective closure of an affine scheme has no components in the hyperplane at infinity.
Cite
@article{arxiv.1707.00925,
title = {Elimination via saturation},
author = {Mohamed Barakat and Markus Lange-Hegermann and Sebastian Posur},
journal= {arXiv preprint arXiv:1707.00925},
year = {2020}
}
Comments
Minor improvements