Minimal monomial ideals and linear resolutions
| dc.creator | Phan, Jeffry | |
| dc.date | 2005-11-02 | |
| dc.date | 2005-11-03 | |
| dc.date.accessioned | 2026-07-07T06:50:37Z | |
| dc.date.available | 2026-07-07T06:50:37Z | |
| dc.description | A minimal monomial ideal is the combinatorially simplest monomial ideal whose lcm-lattice equals a given finite atomic lattice $\hat{L}$. The minimal ideal inherits many nice properties of any ideal $I$ whose lcm-lattice also equals $\hat{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. | |
| dc.description | 14 pages, 4 figures. 2 corrections have been made: (1) The hypothesis in Proposition 2.6 have been corrected to exclude the boundary complex of a simplex. (2) The labeling of the triangle in Figure 2 has been corrected | |
| dc.identifier | https://arxiv.org/abs/math/0511032 | |
| dc.identifier | http://arxiv.org/abs/math/0511032 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/104723 | |
| dc.subject | Commutative Algebra | |
| dc.subject | Combinatorics | |
| dc.title | Minimal monomial ideals and linear resolutions | |
| dc.type | text |