Papers
Topics
Authors
Recent
Search
2000 character limit reached

On basic double G-links of squarefree monomial ideals

Published 31 Aug 2022 in math.AC and math.CO | (2209.00119v2)

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)$ 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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.