Abstract
As we pointed out before, several problems within ideal and module theory, such as the computation of intersections, may be solved by using elimination techniques. However, it appears that this approach is highly inefficient from the computational point of view, mainly due to the necessary use of the lex ordering (or, more generally, any elimination ordering). Actually, lots of effort has been spent in the past in order to avoid the use of eliminations in computations involving Gröbner bases.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Bueso, J., Gómez-Torrecillas, J., Verschoren, A. (2003). Syzygies and applications. In: Algorithmic Methods in Non-Commutative Algebra. Mathematical Modelling, vol 17. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-0285-0_6
Download citation
DOI: https://doi.org/10.1007/978-94-017-0285-0_6
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-6328-1
Online ISBN: 978-94-017-0285-0
eBook Packages: Springer Book Archive