arXiv · 1209.6372
Betti numbers of cut ideals of trees
Abstract
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.
Explore related subjects
Keep this discovery
Samu Potka, Camilo Sarmiento. 2012-09-27. Betti numbers of cut ideals of trees. https://arxiv.org/abs/1209.6372
Cite the original work for its findings. Save a collection to share your selection of sources.