Simplicial cycles and the computation of simplicial trees

DOI10.1016/j.jsc.2006.03.004zbMath1124.05094arXivmath/0606375OpenAlexW1992772797MaRDI QIDQ2457409

Massimo Caboara, Peter Selinger, Sara Faridi

Publication date: 23 October 2007

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0606375

zbMATH Keywords

simplicial treeFacet idealsimplicial cycle

Mathematics Subject Classification ID

Related Items (4)

Monomial resolutions supported by simplicial trees ⋮ Monomial ideals, edge ideals of hypergraphs, and their graded Betti numbers ⋮ On a class of squarefree monomial ideals of linear type ⋮ Cohen-Macaulay growing graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On the ideal theory of graphs
• Cohen-Macaulay properties of square-free monomial ideals
• Cohen-Macaulay graphs
• The facet ideal of a simplicial complex
• Simplicial trees are sequentially Cohen-Macaulay
• Tree Checking for Sparse Complexes

This page was built for publication: Simplicial cycles and the computation of simplicial trees