Skip to main content

Part of the book series: Mathematics for Industry ((MFI,volume 5))

  • 1928 Accesses

Abstract

Computer Algebra is a field of mathematics and computer science that studies algorithms for symbolic computation. A fundamental tool in computer algebra to study polynomial ideals is the theory of Geöbner basis. The notion of the Gröbner basis and the Buchberger’s algorithm for computing it was proposed by Bruno Buchberger in 1965. Gröbner bases have numerous applications in commutative algebra, algebraic geometry, combinatorics, coding theory, cryptography, theorem proving, etc. The Buchberger’s algorithm is implemented in many computer algebra systems, such as Risa/Asir, Macaulay2, Singular, CoCoa, Maple, and Mathematica. In this chapter, we will give a short introduction on Gröbner basis theory, and then we will present some applications of Gröbner bases.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.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. D. Avis, K. Fukuda, Reverse search for enumeration. Discrete Appl. Math. 65, 21–46 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  2. P. Conti, C. Traverso, Buchberger algorithm and integer programming, in Proceedings of the AAECC-9. LNCS, vol. 539 (Springer, New Orleans, 1991), pp. 130–139

    Google Scholar 

  3. D. Cox, J. Little, D. O’Shea, Ideals, Varieties and Algorithms (Springer, Berlin, 1992)

    Book  MATH  Google Scholar 

  4. D. Cox, J. Little, D. O’Shea, Using Algebraic Geometry (Springer, Berlin, 1998)

    Book  MATH  Google Scholar 

  5. P. Diaconis, B. Sturmfels, Algebraic algorithms for sampling from conditional distributions. Ann. Statist. 26(1), 363–397 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  6. D. Eisenbud, Commutative Algebra with a View Toward Algebraic Geometry (Springer, Berlin, 1995)

    Google Scholar 

  7. B. Sturmfels, Gröbner Bases and Convex Polytopes, (Lectures Series), vol. 8, (American Mathematics Society, Providence, 1996)

    Google Scholar 

  8. S. Hoşten, B. Sturmfels, Computing the integer programming gap. Combinatorica 27, 367–382 (2007)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Takafumi Shibuta .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer Japan

About this chapter

Cite this chapter

Shibuta, T. (2014). Gröbner Basis and Its Applications. In: Nishii, R., et al. A Mathematical Approach to Research Problems of Science and Technology. Mathematics for Industry, vol 5. Springer, Tokyo. https://doi.org/10.1007/978-4-431-55060-0_5

Download citation

  • DOI: https://doi.org/10.1007/978-4-431-55060-0_5

  • Published:

  • Publisher Name: Springer, Tokyo

  • Print ISBN: 978-4-431-55059-4

  • Online ISBN: 978-4-431-55060-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics