Simplicial cycles and the computation of simplicial trees

Simple item page
dc.creatorCaboara, Massimo
dc.creatorFaridi, Sara
dc.creatorSelinger, Peter
dc.date2006-06-15
dc.date.accessioned2026-07-07T07:17:20Z
dc.date.available2026-07-07T07:17:20Z
dc.descriptionWe generalize the concept of a cycle from graphs to simplicial complexes. We show that a simplicial cycle is either a sequence of facets connected in the shape of a circle, or is a cone over such a structure. We show that a simplicial tree is a connected cycle-free simplicial complex, and use this characterization to produce an algorithm that checks in polynomial time whether a simplicial complex is a tree. We also present an efficient algorithm for checking whether a simplicial complex is grafted, and therefore Cohen-Macaulay.
dc.description17 pages
dc.identifierhttps://arxiv.org/abs/math/0606375
dc.identifierhttp://arxiv.org/abs/math/0606375
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/113904
dc.subjectCommutative Algebra
dc.subjectCombinatorics
dc.subject13P04
dc.titleSimplicial cycles and the computation of simplicial trees
dc.typetext

Files

Collections

arXiv