This book demonstrates current trends in research on combinatorial and computational commutative algebra with a primary emphasis on topics related to monomial ideals. Providing a useful and quick introduction to areas of research spanning these fields, Monomial Ideals is split into three parts. Part I offers a quick introduction to the modern theory of Gröbner bases as well as the detailed study of generic initial ideals. Part II supplies Hilbert functions and resolutions and some of the combinatorics related to monomial ideals including the Kruskal—Katona theorem and algebraic aspects of Alexander duality. Part III discusses combinatorial applications of monomial ideals, providing a valuable overview of some of the central trends in algebraic combinatorics. Main subjects include edge ideals of finite graphs, powers of ideals, algebraic shifting theory and an introduction to discrete polymatroids. Theory is complemented by a number of examples and exercises throughout, bringing the reader to a deeper understanding of concepts explored within the text. Self-contained and concise, this book will appeal to a wide range of readers, including PhD students on advanced courses, experienced researchers, and combinatorialists and non-specialists with a basic knowledge of commutative algebra. Since their first meeting in 1985, Juergen Herzog (Universität Duisburg-Essen, Germany) and Takayuki Hibi (Osaka University, Japan), have worked together on a number of research projects, of which recent results are presented in this monograph.

This textbook on combinatorial commutative algebra focuses on properties of monomial ideals in polynomial rings and their connections with other areas of mathematics such as combinatorics, electrical engineering, topology, geometry, and homological algebra. Aimed toward advanced undergraduate students and graduate students who have taken a basic course in abstract algebra that includes polynomial rings and ideals, this book serves as a core text for a course in combinatorial commutative algebra or as preparation for more advanced courses in the area. The text contains over 600 exercises to provide readers with a hands-on experience working with the material; the exercises include computations of specific examples and proofs of general results. Readers will receive a firsthand introduction to the computer algebra system Macaulay2 with tutorials and exercises for most sections of the text, preparing them for significant computational work in the area. Connections to non-monomial areas of abstract algebra, electrical engineering, combinatorics and other areas of mathematics are provided which give the reader a sense of how these ideas reach into other areas.

This work covers three important aspects of monomials ideals in the three chapters "Stanley decompositions" by Jürgen Herzog, "Edge ideals" by Adam Van Tuyl and "Local cohomology" by Josep Álvarez Montaner. The chapters, written by top experts, include computer tutorials that emphasize the computational aspects of the respective areas. Monomial ideals and algebras are, in a sense, among the simplest structures in commutative algebra and the main objects of combinatorial commutative algebra. Also, they are of major importance for at least three reasons. Firstly, Gröbner basis theory allows us to treat certain problems on general polynomial ideals by means of monomial ideals. Secondly, the combinatorial structure of monomial ideals connects them to other combinatorial structures and allows us to solve problems on both sides of this correspondence using the techniques of each of the respective areas. And thirdly, the combinatorial nature of monomial ideals also makes them particularly well suited to the development of algorithms to work with them and then generate algorithms for more general structures.

Grobner-Basen werden von Mathematikern und Informatikern zunehmend fur eine breite Palette von Anwendungen genutzt, in denen die algorithmische algebraische Geometrie eine Rolle spielt. Hier werden Grobner-Basen von einem konstruktiven, wenig abstrakten Standpunkt aus behandelt, wobei nur geringe Vorkenntnisse in linearer Algebra und komplexen Zahlen vorausgesetzt werden; zahlreiche Beispiele helfen bei der Durchdringung des Stoffes. Mit einer Ubersicht uber aktuell erhaltliche relevante Softwarepakete.

Ideal for graduate students and researchers, this book presents a unified treatment of the central notions of integral closure.

This book details the heart and soul of modern commutative and algebraic geometry. It covers such topics as the Hilbert Basis Theorem, the Nullstellensatz, invariant theory, projective geometry, and dimension theory. In addition to enhancing the text of the second edition, with over 200 pages reflecting changes to enhance clarity and correctness, this third edition of Ideals, Varieties and Algorithms includes: a significantly updated section on Maple; updated information on AXIOM, CoCoA, Macaulay 2, Magma, Mathematica and SINGULAR; and presents a shorter proof of the Extension Theorem.

Recent developments are covered Contains over 100 figures and 250 exercises Includes complete proofs

This book discusses regular powers and symbolic powers of ideals from three perspectives– algebra, combinatorics and geometry – and examines the interactions between them. It invites readers to explore the evolution of the set of associated primes of higher and higher powers of an ideal and explains the evolution of ideals associated with combinatorial objects like graphs or hypergraphs in terms of the original combinatorial objects. It also addresses similar questions concerning our understanding of the Castelnuovo-Mumford regularity of powers of combinatorially defined ideals in terms of the associated combinatorial data. From a more geometric point of view, the book considers how the relations between symbolic and regular powers can be interpreted in geometrical terms. Other topics covered include aspects of Waring type problems, symbolic powers of an ideal and their invariants (e.g., the Waldschmidt constant, the resurgence), and the persistence of associated primes.

This book presents algorithmic tools for algebraic geometry, with experimental applications. It also introduces Macaulay 2, a computer algebra system supporting research in algebraic geometry, commutative algebra, and their applications. The algorithmic tools presented here are designed to serve readers wishing to bring such tools to bear on their own problems. The first part of the book covers Macaulay 2 using concrete applications; the second emphasizes details of the mathematics.