Persistent Link:
http://hdl.handle.net/10150/291493
Title:
Introduction to Groebner bases with applications
Author:
Moelich, Mark Christopher, 1962-
Issue Date:
1998
Publisher:
The University of Arizona.
Rights:
Copyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.
Abstract:
Grobner bases were introduced by Bruno Buchberger in 1965. Since that time, they have been used with considerable success in several area of Mathematics, and are the subject of much current research. The most important aspect of Grobner bases is that they can be computed. Such computations bring a wealth of examples to theoretical research, and allow some important result to be applied. This thesis develops the algebraic concept needed to understand Grobner bases. The presentation focuses on the role of monomial ideals. Grobner bases are seen to provide an effective means of computing in the factor rings of multivariable polynomials. The theory is applied to rewriting of polynomial equations and to integer programming.
Type:
text; Thesis-Reproduction (electronic)
Keywords:
Mathematics.; Operations Research.
Degree Name:
M.S.
Degree Level:
masters
Degree Program:
Graduate College; Mathematics
Degree Grantor:
University of Arizona
Advisor:
Grove, Larry C.

Full metadata record

DC FieldValue Language
dc.language.isoen_USen_US
dc.titleIntroduction to Groebner bases with applicationsen_US
dc.creatorMoelich, Mark Christopher, 1962-en_US
dc.contributor.authorMoelich, Mark Christopher, 1962-en_US
dc.date.issued1998en_US
dc.publisherThe University of Arizona.en_US
dc.rightsCopyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.en_US
dc.description.abstractGrobner bases were introduced by Bruno Buchberger in 1965. Since that time, they have been used with considerable success in several area of Mathematics, and are the subject of much current research. The most important aspect of Grobner bases is that they can be computed. Such computations bring a wealth of examples to theoretical research, and allow some important result to be applied. This thesis develops the algebraic concept needed to understand Grobner bases. The presentation focuses on the role of monomial ideals. Grobner bases are seen to provide an effective means of computing in the factor rings of multivariable polynomials. The theory is applied to rewriting of polynomial equations and to integer programming.en_US
dc.typetexten_US
dc.typeThesis-Reproduction (electronic)en_US
dc.subjectMathematics.en_US
dc.subjectOperations Research.en_US
thesis.degree.nameM.S.en_US
thesis.degree.levelmastersen_US
thesis.degree.disciplineGraduate Collegeen_US
thesis.degree.disciplineMathematicsen_US
thesis.degree.grantorUniversity of Arizonaen_US
dc.contributor.advisorGrove, Larry C.en_US
dc.identifier.proquest1389599en_US
dc.identifier.bibrecord.b38650228en_US
All Items in UA Campus Repository are protected by copyright, with all rights reserved, unless otherwise indicated.