Cohen-Macaulay admissible clutters

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

There 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.
13 pages, final version to appear in J. Comm. Alg

Keywords

Commutative Algebra, Combinatorics, 13F55, 05C65, 05C75

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/156570

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0803.1332
 http://arxiv.org/abs/0803.1332

Collections

arXiv