Article thumbnail

Generic and Cogeneric Monomial Ideals

By Ezra Miller, Bernd Sturmfels and Kohji Yanagawa

Abstract

AbstractMonomial ideals which are generic with respect to either their generators or irreducible components have minimal free resolutions encoded by simplicial complexes. There are numerous equivalent ways to say that a monomial ideal is generic or cogeneric. For a generic monomial ideal, the associated primes satisfy a saturated chain condition, and the Cohen–Macaulay property implies shellability for both the Scarf complex and the Stanley–Reisner complex. Reverse lexicographic initial ideals of generic lattice ideals are generic. Cohen–Macaulayness for cogeneric ideals is characterized combinatorially; in the cogeneric case, the Cohen–Macaulay type is greater than or equal to the number of irreducible components. Methods of proof include Alexander duality and Stanley’s theory of local h -vectors

Publisher: Academic Press.
Year: 2000
DOI identifier: 10.1006/jsco.1999.0290
OAI identifier:

Suggested articles


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.