Minimal monomial ideals and linear resolutions
Jeffry Phan
Abstract
A minimal monomial ideal is the combinatorially simplest monomial ideal whose lcm-lattice equals a given finite atomic lattice L. The minimal ideal inherits many nice properties of any ideal I whose lcm-lattice also equals L, e.g. Cohen-Macaulayness and the dual property of having a linear resolution. Conversely, any ideal having a linear resolution is shown to be (essentially) minimal.
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