English

On basic double G-links of squarefree monomial ideals

Commutative Algebra 2024-02-28 v2 Combinatorics

Abstract

Nagel and R\"omer 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)I(G) is the edge ideal of a graph GG. When I(G)I(G) is a basic double G-link of a monomial ideal BB on an arbitrary homogeneous ideal AA, we give a generating set for BB in terms of GG and show that this basic double G-link must be of degree 11. 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.

Keywords

Cite

@article{arxiv.2209.00119,
  title  = {On basic double G-links of squarefree monomial ideals},
  author = {Patricia Klein and Matthew Koban and Jenna Rajchgot},
  journal= {arXiv preprint arXiv:2209.00119},
  year   = {2024}
}

Comments

Final version. Updated to reflect revisions in response to referee recommendations and the excellent copy editing from the Journal of Commutative Algebra, for which we are grateful

R2 v1 2026-06-28T00:31:29.731Z