arXivDaily arXiv每日学术速递 周一至周五更新
今晚才能更新了~~大家休息下再来吧
arXiv math/0606375math.ACmath.CO
收藏

Simplicial cycles and the computation of simplicial trees

Massimo Caboara, Sara Faridi, Peter Selinger

英文摘要:

We 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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑