Cohen-Macaulay admissible clutters

Simple item page
dc.creatorHa, Huy Tai
dc.creatorMorey, Susan
dc.creatorVillarreal, Rafael H.
dc.date2008-03-10
dc.date.accessioned2026-07-07T09:25:55Z
dc.date.available2026-07-07T09:25:55Z
dc.descriptionThere is a one-to-one correspondence between square-free monomial ideals and clutters, which are also known as simple hypergraphs. It was conjectured that unmixed admissible clutters are Cohen-Macaulay. We prove the conjecture for uniform admissible clutters of heights 2 and 3. For admissible clutters of greater heights, we give a family of examples to show that the conjecture may fail. When the height is 4, we give an additional condition under which unmixed admissible clutters are Cohen-Macaulay.
dc.description13 pages, final version to appear in J. Comm. Alg
dc.identifierhttps://arxiv.org/abs/0803.1332
dc.identifierhttp://arxiv.org/abs/0803.1332
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/156570
dc.subjectCommutative Algebra
dc.subjectCombinatorics
dc.subject13F55, 05C65, 05C75
dc.titleCohen-Macaulay admissible clutters
dc.typetext

Files

Collections

arXiv