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

树的割理想的贝蒂数

Betti numbers of cut ideals of trees

Samu Potka, Camilo Sarmiento

摘要:

由Sturmfels和Sullivant引入的割理想用于遗传学和代数统计。研究了树图的割理想的最小自由分解。利用拓扑组合学的基本方法,我们得到了这类理想的贝蒂数的上界。这些采取的形式简单的公式的顶点数,这是从枚举的诱导子图的某些不可比图与树的边集。

英文摘要:

Cut ideals, introduced by Sturmfels and Sullivant, are used in phylogenetics and algebraic statistics. We study the minimal free resolutions of cut ideals of tree graphs. By employing basic methods from topological combinatorics, we obtain upper bounds for the Betti numbers of this type of ideals. These take the form of simple formulas on the number of vertices, which arise from the enumeration of induced subgraphs of certain incomparability graphs associated to the edge sets of trees.

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

↑