Paper Info
Title
Gröbner Bases Computation and Macaulay Matrices
Abstract
In my PhD thesis 1965 and the subsequent publication 1970 in Aequationes Mathematicae, I introduced the notion of Grobner bases and proved a characterization theorem for Grobner bases on which an algorithm for constructing Grobner bases can be based. The main idea for the theorem and the algorithm was the notion of "S-polynomials". Most of the subsequent work on the algorithmic theory of Grobner bases, including the implementation of the Grobner bases technology in mathematical software systems like Mathematica, Maple, etc. was based on this approach.
Year
DOI
Venue
2017
10.1109/SYNASC.2017.00011
2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)
Keywords
DocType
ISSN
Grobner bases technology,PhD thesis,Aequationes Mathematicae,characterization theorem,s-polynomials,algorithmic theory,mathematical software systems,Grobner bases computation,macaulay matrices
Conference
2470-8801
ISBN
Citations 
PageRank 
978-1-5386-2627-6
0
0.34
References 
Authors
0
1
Name
Order
Citations
PageRank
Bruno Buchberger1847168.26