To a simplicial complex, we associate a square-free monomial ideal in the polynomial ring generated by its vertex set over a field. We study algebraic properties of this ideal via combinatorial properties of the simplicial complex. By generalizing the notion of a tree from graphs to simplicial complexes, we show that ideals associated to trees satisfy sliding depth condition, and therefore have normal and Cohen-Macaulay Rees rings. We also discuss connections with the theory of Stanley-Reisner rings.
In this paper, we study simplicial complexes as higher-dimensional graphs in order to produce algebraic statements about their facet ideals. We introduce a large class of square-free monomial ideals with Cohen-Macaulay quotients, and a criterion for the Cohen-Macaulayness of facet ideals of simplicial trees. Along the way, we generalize several concepts from graph theory to simplicial complexes.
This paper uses dualities between facet ideal theory and Stanley-Reisner theory to show that the facet ideal of a simplicial tree is sequentially Cohen-Macaulay. The proof involves showing that the Alexander dual (or the cover dual, as we call it here) of a simplicial tree is a componentwise linear ideal. We conclude with additional combinatorial properties of simplicial trees.
In this paper we extend one direction of Fröberg's theorem on a combinatorial classification of quadratic monomial ideals with linear resolutions. We do this by generalizing the notion of a chordal graph to higher dimensions with the introduction of d-chorded and orientably-d-cycle-complete simplicial complexes. We show that a certain class of simplicial complexes, the d-dimensional trees, correspond to ideals having linear resolutions over fields of characteristic 2 and we also give a necessary combinatorial condition for a monomial ideal to be componentwise linear over all fields.
We give a formula to compute all the top degree graded Betti numbers of the path ideal of a cycle. Also we will find a criterion to determine when Betti numbers of this ideal are non zero and give a formula to compute its projective dimension and regularity.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.