Monomial ideals of weighted oriented graphs
Commutative Algebra
2020-12-08 v1
Abstract
Let I=I(D) be the edge ideal of a weighted oriented graph D. We determine the irredundant irreducible decomposition of I. Also, we characterize the associated primes and the unmixed property of I. Furthermore, we give a combinatorial characterization for the unmixed property of I, when D is bipartite, D is a whisker or D is a cycle. Finally, we study the Cohen-Macaulay property of I.
Cite
@article{arxiv.1710.03785,
title = {Monomial ideals of weighted oriented graphs},
author = {Yuriko Pitones and Enrique Reyes and Jonathan Toledo},
journal= {arXiv preprint arXiv:1710.03785},
year = {2020}
}
Comments
15 pages