Simplicial Trees are Sequentially Cohen-Macaulay

Simple item page
dc.creatorFaridi, Sara
dc.date2003-08-27
dc.date.accessioned2026-07-07T05:00:39Z
dc.date.available2026-07-07T05:00:39Z
dc.descriptionThis 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.
dc.description15 pages, 15 figures
dc.identifierhttps://arxiv.org/abs/math/0308264
dc.identifierhttp://arxiv.org/abs/math/0308264
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/68397
dc.subjectCommutative Algebra
dc.subjectCombinatorics
dc.subject13;05
dc.titleSimplicial Trees are Sequentially Cohen-Macaulay
dc.typetext

Files

Collections

arXiv