English

Cohen-Macaulay and Gorenstein path ideals of trees

Combinatorics 2015-04-24 v1

Abstract

Let R=k[x1,,xn]R=k[x_{1},\ldots,x_{n}], where kk is a field. The path ideal (of length t2t\geq 2) of a directed graph GG is the monomial ideal, denoted by It(G)I_{t}(G), whose generators correspond to the directed paths of length tt in GG. Let Γ\Gamma be a directed rooted tree. We characterize all such trees whose path ideals are unmixed and Cohen-Macaulay. Moreover, we show that R/It(Γ)R/I_{t}(\Gamma) is Gorenstein if and only if the Stanley-Reisner simplicial complex of It(Γ)I_{t}(\Gamma) is a matroid.

Keywords

Cite

@article{arxiv.1504.06001,
  title  = {Cohen-Macaulay and Gorenstein path ideals of trees},
  author = {Sara Saeedi Madani and Dariush Kiani},
  journal= {arXiv preprint arXiv:1504.06001},
  year   = {2015}
}

Comments

10 pages, 4 figures, to appear in Algebra Colloquium. arXiv admin note: text overlap with arXiv:0708.3111 by other authors