𝔖 Scriptorium
✦   LIBER   ✦

📁

Gröbner Bases and Convex Polytopes

✍ Scribed by Bernd Sturmfels


Publisher
American Mathematical Society
Year
1996
Tongue
English
Leaves
174
Series
University Lecture Series, No. 8
Category
Library

⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Synopsis


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.


📜 SIMILAR VOLUMES


Grobner Bases and Convex Polytopes
✍ Bernd Sturmfels 📂 Library 📅 1995 🏛 American Mathematical Society 🌐 English

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 def

Grobner bases and convex polytopes
✍ Bernd Sturmfels 📂 Library 📅 1996 🏛 American Mathematical Society 🌐 English

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 def

Gröbner Bases and Applications
✍ Bruno Buchberger, Franz Winkler 📂 Library 📅 1998 🏛 Cambridge University Press 🌐 English

The theory of Gröbner bases, invented by Bruno Buchberger, is a general method by which many fundamental problems in various branches of mathematics and engineering can be solved by structurally simple algorithms. The method is now available in all major mathematical software systems. This book prov