Anzeige
Erschienen in:
2014 | OriginalPaper | Buchkapitel
Gröbner Basis and Its Applications
verfasst von : Takafumi Shibuta
Erschienen in: A Mathematical Approach to Research Problems of Science and Technology
Verlag: Springer Japan
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.