Generic and Cogeneric Monomial Ideals
Ezra Miller, Bernd Sturmfels, Kohji Yanagawa
Abstract
Monomial ideals which are generic with respect to either their generators or irreducible components have minimal free resolutions derived from simplicial complexes. 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.
Create a lesson
Related papers
On the weak Lefschetz property of Artinian Gorenstein algebras of codimension three in arbitrary characteristic
Omkar Javadekar
Linear Independence of Polynomial Compositions and Identifiability of Deep Neural Networks
Kathlén Kohn, Giovanni Luca Marchetti, Alex Massarenti et al.
Comparing v-numbers of symbolic and ordinary powers of squarefree monomial ideals
Trung Chau, Tài Huy Hà, A. V. Jayanthan et al.
Polynomial extensions do not preserve the strong finite type property
Viet-Hoang Tran, Phan Thanh Toan, Thieu N. Vo et al.
Reduction numbers for witnesses to the generalized Loewy length
Richard Bartels, Sarah Dajani, Gabriel Koomson
Multi-graded generic initial ideals, regularity, and the optimal colorful fractional Helly theorem for d-Leray complexes
Daniel McGinnis