Monomial cut ideals
Commutative Algebra
2011-05-19 v1 Combinatorics
Abstract
B. Sturmfels and S. Sullivant associated to any graph a toric ideal, called the cut ideal. We consider monomial cut ideals and we show that their algebraic properties such as the minimal primary decomposition, the property of having a linear resolution or being Cohen--Macaulay may be derived from the combinatorial structure of the graph.
Cite
@article{arxiv.1105.3564,
title = {Monomial cut ideals},
author = {Anda Olteanu},
journal= {arXiv preprint arXiv:1105.3564},
year = {2011}
}