On basic double G-links of squarefree monomial ideals
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913244900229120 |
|---|---|
| author | Klein, Patricia Koban, Matthew Rajchgot, Jenna |
| author_facet | Klein, Patricia Koban, Matthew Rajchgot, Jenna |
| contents | Nagel and Römer introduced the class of weakly vertex decomposable simplicial complexes, which include matroid, shifted, and Gorenstein complexes as well as vertex decomposable complexes. They proved that the Stanley-Reisner ideal of every weakly vertex decomposable simplicial complex is Gorenstein linked to an ideal of indeterminates via a sequence of basic double G-links. In this paper, we explore basic double G-links between squarefree monomial ideals beyond the weakly vertex decomposable setting.
Our first contribution is a structural result about certain basic double G-links which involve an edge ideal. Specifically, suppose $I(G)$ is the edge ideal of a graph $G$. When $I(G)$ is a basic double G-link of a monomial ideal $B$ on an arbitrary homogeneous ideal $A$, we give a generating set for $B$ in terms of $G$ and show that this basic double G-link must be of degree $1$. Our second focus is on examples from the literature of simplicial complexes known to be Cohen-Macaulay but not weakly vertex decomposable. We show that these examples are not basic double links of any other squarefree monomial ideals. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2209_00119 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | On basic double G-links of squarefree monomial ideals Klein, Patricia Koban, Matthew Rajchgot, Jenna Commutative Algebra Combinatorics 13C40, 13F55 Nagel and Römer introduced the class of weakly vertex decomposable simplicial complexes, which include matroid, shifted, and Gorenstein complexes as well as vertex decomposable complexes. They proved that the Stanley-Reisner ideal of every weakly vertex decomposable simplicial complex is Gorenstein linked to an ideal of indeterminates via a sequence of basic double G-links. In this paper, we explore basic double G-links between squarefree monomial ideals beyond the weakly vertex decomposable setting. Our first contribution is a structural result about certain basic double G-links which involve an edge ideal. Specifically, suppose $I(G)$ is the edge ideal of a graph $G$. When $I(G)$ is a basic double G-link of a monomial ideal $B$ on an arbitrary homogeneous ideal $A$, we give a generating set for $B$ in terms of $G$ and show that this basic double G-link must be of degree $1$. Our second focus is on examples from the literature of simplicial complexes known to be Cohen-Macaulay but not weakly vertex decomposable. We show that these examples are not basic double links of any other squarefree monomial ideals. |
| title | On basic double G-links of squarefree monomial ideals |
| topic | Commutative Algebra Combinatorics 13C40, 13F55 |
| url | https://arxiv.org/abs/2209.00119 |