Cohen-Macaulay and Gorenstein path ideals of trees
Abstract
Let R=k[x1,…,xn], where k is a field. The path ideal (of length t≥ 2) of a directed graph G is the monomial ideal, denoted by It(G), whose generators correspond to the directed paths of length t in G. Let be a directed rooted tree. We characterize all such trees whose path ideals are unmixed and Cohen-Macaulay. Moreover, we show that R/It() is Gorenstein if and only if the Stanley-Reisner simplicial complex of It() is a matroid.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.