arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2211.04640math.ACmath.CO
收藏

Barile-Macchia分解

Barile-Macchia resolutions

Trung Chau, Selvi Kara

AI总结:

该研究利用离散Morse理论构造单项式理想的Barile-Macchia胞腔分解,证明其对加权有向森林和多数环的边理想极小,给出分次Betti数与投射维数递推公式,并验证其在特定条件下的极小性优势。

摘要:

我们通过离散Morse理论构造单项式理想的胞腔分解。具体而言,我们提出一种生成齐次无环匹配的算法,并将由这些匹配诱导的胞腔分解称为Barile-Macchia分解。这类分解对加权有向森林及(绝大多数)环的边理想是极小的,由此我们给出了分次Betti数与投射维数的递推公式。此外,我们将Barile-Macchia分解与Batzies和Welker提出的分解以及一些知名的单纯分解进行了比较:在特定假设下,只要上述分解是极小的,Barile-Macchia分解也同样是极小的。

英文摘要:

We construct cellular resolutions for monomial ideals via discrete Morse theory. In particular, we develop an algorithm to create homogeneous acyclic matchings and we call the cellular resolutions induced from these matchings Barile-Macchia resolutions. These resolutions are minimal for edge ideals of weighted oriented forests and (most) cycles. As a result, we provide recursive formulas for graded Betti numbers and projective dimension. Furthermore, we compare Barile-Macchia resolutions to those created by Batzies and Welker and some well-known simplicial resolutions. Under certain assumptions, whenever the above resolutions are minimal, so are Barile-Macchia resolutions.

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

↑