Cohen-Macaulay and Gorenstein path ideals of trees
Combinatorics
2015-04-24 v1
Abstract
Let , where is a field. The path ideal (of length ) of a directed graph is the monomial ideal, denoted by , whose generators correspond to the directed paths of length in . Let be a directed rooted tree. We characterize all such trees whose path ideals are unmixed and Cohen-Macaulay. Moreover, we show that is Gorenstein if and only if the Stanley-Reisner simplicial complex of 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