Fröberg定理、顶点可分裂性与高阶独立复形
Fröberg's Theorem, vertex splittability and higher independence complexes
AI总结：
该研究将Fröberg定理推广至高次无平方单项式理想，通过r-独立构造r-均匀超图，证明共弦图对应边理想具顶点可分裂性，计算了分次Betti数，并给出线性消解存在性的拓扑证明。
摘要：
Fröberg的著名定理给出了具有线性消解的二次无平方单项式理想的完整组合分类。将该定理推广到更高次无平方单项式理想是一个活跃的研究领域。这类理想的线性消解的存在性通常取决于多项式环所定义的域。因此，期望在更高次情形下仅利用相关组合结构的组合特征来判定线性消解，是要求过高了。不过，已有若干类具有线性消解的理想通过组合结构得到了识别。在本文中，我们利用r-独立的概念，从给定的图构造出一个r-均匀超图。随后我们证明，当底层图是共弦图时，对应的边理想是顶点可分裂的——这是一个比具有线性消解更强的条件。我们利用这一结果，显式计算了各类图的分次Betti数。最后，我们利用r-可塌缩性的拓扑概念，给出了线性消解存在性的另一种证明。
英文摘要：
A celebrated theorem of Fröberg gives a complete combinatorial classification of quadratic square-free monomial ideals with a linear resolution. A generalization of this theorem to higher degree square-free monomial ideals is an active area of research. The existence of a linear resolution of such ideals often depends on the field over which the polynomial ring is defined. Hence, it is too much to expect that in the higher degree case a linear resolution can be identified purely using a combinatorial feature of an associated combinatorial structure. However, some classes of ideals having linear resolutions have been identified using combinatorial structures. In the present paper, we use the notion of $r$-independence to construct an $r$-uniform hypergraph from the given graph. We then show that when the underlying graph is co-chordal, the corresponding edge ideal is vertex splittable, a condition stronger than having a linear resolution. We use this result to explicitly compute graded Betti numbers for various graph classes. Finally, we give a different proof for the existence of a linear resolution using the topological notion of $r$-collapsibility.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
