arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2309.07587math.AC
收藏

紧图的边环

The edge rings of compact graphs

Zexin Wang, Dancheng Lu

AI总结:

本文分类了无偶环且满足奇环条件的紧图,并证明其边环的Cohen-Macaulay型、投射维数等于诱导环数减一,正则度等于删去一度顶点后所得图的匹配数。

摘要:

我们定义一个简单图为紧图,如果它没有偶环且满足奇环条件。我们的重点是分类所有紧图并研究其边环的性质。设 $G$ 是一个紧图,$\mathbb{K}[G]$ 是其边环。具体地,我们证明 $\mathbb{K}[G]$ 的 Cohen-Macaulay 型和投射维数都等于 $G$ 的诱导环数减一,并且 $\mathbb{K}[G]$ 的正则度等于 $G_0$ 的匹配数。这里,$G_0$ 是通过连续删除度为一的顶点从 $G$ 得到的图,结果是一个每个顶点的度都大于 1 的图。

英文摘要:

We define a simple graph as compact if it lacks even cycles and satisfies the odd-cycle condition. Our focus is on classifying all compact graphs and examining the characteristics of their edge rings. Let $G$ be a compact graph and $\mathbb{K}[G]$ be its edge ring. Specifically, we demonstrate that the Cohen-Macaulay type and the projective dimension of $\mathbb{K}[G]$ are both equal to the number of induced cycles of $G$ minus one, and that the regularity of $\mathbb{K}[G]$ is equal to the matching number of $G_0$. Here, $G_0$ is obtained from $G$ by removing the vertices of degree one successively, resulting in a graph where every vertex has a degree greater than 1.

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

↑