Monomial Ideals, Computations and Applications edited by Anna M. Bigatti, Philippe Gimenez, Eduardo Sáenz-de-Cabezón.

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 tutorial...

Full description

Saved in:
Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Bigatti, Anna M. (Editor), Gimenez, Philippe (Editor), Sáenz-de-Cabezón, Eduardo (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2013.
Edition:1st ed. 2013.
Series:Lecture Notes in Mathematics, 2083
Springer eBook Collection.
Subjects:
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.
Description
Summary: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.
Physical Description:XI, 194 p. 42 illus. online resource.
ISBN:9783642387425
ISSN:0075-8434 ;
DOI:10.1007/978-3-642-38742-5