Grobner Bases and Convex Polytopes (University Lecture Series, No. 8) by Bernd Sturmfels (PDF)

Description

This book is about the interplay of computational commutative algebra and the theory of convex polytopes. It centers around a special class of ideals in a polynomial ring: the class of toric ideals. They are characterized as those prime ideals that are generated by monomial differences or as the defining ideals of toric varieties (not necessarily normal). The interdisciplinary nature of the study of Gröbner bases is reflected by the specific applications appearing in this book. These applications lie in the domains of integer programming and computational statistics. The mathematical tools presented in the volume are drawn from commutative algebra, combinatorics, and polyhedral geometry.

User’s Reviews

Editorial Reviews: Review “This book is a state-of-the-art account of the rich interplay between combinatorics and geometry of convex polytopes and computational commutative algebra via the tool of Gröbner bases. It is an essential introduction for those who wish to perform research in this fast-developing, interdisciplinary field. For the math programmer, this book could be viewed as an exposition of the interactions between integer programming and Gröbner bases.” —- Optima”Material is presented in a concise way … lots of motivating examples … not only of interest for mathematicians studying Gröbner bases, but also for researchers working on the mathematical aspects of integer programming and computational statistics.” —- Newsletter on Computational and Applied Mathematics”Thanks to the author’s ingenious writing, most of the material should be accessible to first-year graduate students in mathematics … will be a landmark for further study of Gröbner bases in new branches of mathematics. It underlines the powerful techniques of commutative algebra in the interplay with combinatorics and polyhedral geometry.” — Mathematical Reviews —- Mathematical Reviews

Reviews from Amazon users which were colected at the time this book was published on the website:

⭐I cannot recommend this text highly enough to anyone who is working with Grobner bases, especially in computational commutative algebra. Toric ideals, the state polytope, several algorithms for computing Grobner bases — Sturmfels brings all this together, as well as showing how it can all be applied to problems such as that of integer programming.Thanks to his excellent taste in the theorems he presents, Sturmfels has managed to put all this together in a relatively small, well-written package. However, his brevity has made this a very dense text — you would do well to keep a copy of Schrijver’s Theory of Linear and Integer Programming at hand for proofs of some of the theorems, and if you are like me (a first year grad student) you will invariably need to look in some other algebraic and geometric texts for a more thorough treatment of some of the topics in here.

⭐Another impenetrable text from this author.Too bad, it was so unnecessary as the subjecteasily lends itself to user friendly exposition.

Keywords

Free Download Grobner Bases and Convex Polytopes (University Lecture Series, No. 8) in PDF format
Grobner Bases and Convex Polytopes (University Lecture Series, No. 8) PDF Free Download
Download Grobner Bases and Convex Polytopes (University Lecture Series, No. 8) 1995 PDF Free
Grobner Bases and Convex Polytopes (University Lecture Series, No. 8) 1995 PDF Free Download
Download Grobner Bases and Convex Polytopes (University Lecture Series, No. 8) PDF
Free Download Ebook Grobner Bases and Convex Polytopes (University Lecture Series, No. 8)