Skip to main content

Preliminaries

  • Chapter
  • First Online:
The Gröbner Cover

Part of the book series: Algorithms and Computation in Mathematics ((AACIM,volume 27))

  • 571 Accesses

Abstract

It is assumed that the reader is familiar with ordinary Gröbner Basis theory (GB). As GB is the support of the Gröbner Cover (GC), in Sects. 1.1, 1.2 and 1.3 we introduce some notations and recall central elements of the theory without proofs. This introduction should not be considered as a description of ordinary GB theory, for which we refer to the excellent books of Cox, Little, O’Shea (1992 1st ed, 2007 3rd ed) [25], Becker-Weispfenning [6], Adams-Loustaunau [2] and Eisenbud (1994 1st ed, 1998 3rd ed) [30]. For further relevant studies we refer to the books of Cox, Little, O’Shea [26] and Mora [64, 65].

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 139.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. W. W. Adams, P. Loustaunau, An Introduction to Gröbner Bases, vol. 3, 1st ed., American Mathematical Society, 1994.

    Google Scholar 

  2. M. R. Adhikari, A. Adhikari, Basic Modern Algebra with Applications, Springer, New Delhi, 2014.

    Book  Google Scholar 

  3. P. Aubry, D. Lazard, M. Moreno-Maza, On the theories of triangular sets, Journal of Symbolic Computation 28 (1999) 105–124.

    Article  MathSciNet  Google Scholar 

  4. T. Becker, V. Weispfenning, Gröbner Bases: A Computational Approach to Commutative Algebra, 1st ed., Springer-Verlag, Berlin, 1993.

    Book  Google Scholar 

  5. B. Buchberger, Ein Algorithmus zum Auffinden der Basiselemente des Restklassenrings nach einem nulldimensionalen Polynomideal, Ph.D. Dissertation, University of Innsbruck, 1965.

    MATH  Google Scholar 

  6. B. Buchberger, An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal, translation of Ph.D. Thesis, Journal of Symbolic Computation 41 (2006) 471–511.

    Google Scholar 

  7. C. Chen, J. H. Davenport, M. Moreno-Maza, B. Xia, R. Xiao, Computing with semi-algebraic sets represented by triangular decomposition, in: A. Leykin (ed.), Proceedings of ISSAC’2011, ACM Press, New York, 2011, pp. 75–82.

    Google Scholar 

  8. C. Chen, F. Lemaire, L. Li, M. M. Maza, W. Pan, Y. Xie, The ConstructibleSetTools and ParametricSystemTools modules of the RegularChains library in Maple, in: Proceedings of ICCSA’2008, IEEE Computer Society, 2008, pp. 342–352.

    Google Scholar 

  9. C. Chen, M. Moreno-Maza, Algorithms for computing triangular decomposition of polynomial systems, Journal of Symbolic Computation 47 (6) (2012) 610–642.

    Article  MathSciNet  Google Scholar 

  10. C. Chen, M. Moreno-Maza, Solving parametric polynomial systems by RealComprehensiveTriangularize, in: Mathematical Software-ICMS 2014, Springer, 2014, p. 1st Chapter.

    Google Scholar 

  11. D. Cox, J. Little, D. O’Shea, Ideals, Varieties and Algorithms, 3rd ed., Springer, New-York, 1992.

    Book  Google Scholar 

  12. D. Cox, J. Little, D. O’Shea, Using Algebraic Geometry, Springer, New-York, 1998.

    Book  Google Scholar 

  13. D. Eisenbud, Commutative Algebra with a View Toward Algebraic Geometry, corrected 3rd printing (1999) ed., Springer, New York, 1994.

    Google Scholar 

  14. P. Gianni, B. Trager, G. Zacharias, Gröbner bases and primary decomposition of polynomial ideals, Journal of Symbolic Computation 6 (1988) 149–167.

    Article  MathSciNet  Google Scholar 

  15. D. Lazard, F. Rouillier, Solving parametric polynomial systems, Journal of Symbolic Computation 42 (2007) 636–667.

    Article  MathSciNet  Google Scholar 

  16. A. Montes, H. Schönemann, Singular “grobcov.lib” library D.2.4, http://www.singular.uni-kl.de, Computer Algebra System for polynomial computations. Center for Computer Algebra, University of Kaiserslautern, free software under the GNU General Public Licence (2017).

  17. A. Montes, M. Wibmer, Gröbner bases for polynomial systems with parameters, Journal of Symbolic Computation 45 (2010) 1391–1425.

    Article  MathSciNet  Google Scholar 

  18. T. Mora, Solving Polynomial Equation Systems I: The Kronecker-Duval Philosophy, vol. 88 of Encyclopedia of Mathematics and its Applications, Cambridge University Press, 2003.

    Google Scholar 

  19. T. Mora, Solving Polynomial Equation Systems II: Macaulay’s Paradigm and Gröbner Technology, Encyclopedia of Mathematics and its Applications, Cambridge University Press, 2005.

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Montes, A. (2018). Preliminaries. In: The Gröbner Cover . Algorithms and Computation in Mathematics, vol 27. Springer, Cham. https://doi.org/10.1007/978-3-030-03904-2_1

Download citation

Publish with us

Policies and ethics