Betti Numbers of Cut Ideals of Trees
Keyword(s):
Cut ideals, introduced by Sturmfels and Sullivant, are used in phylogenetics and algebraicstatistics. We study the minimal free resolutions of cut ideals of tree graphs. By employingbasic methods from combinatorial topology, we obtain upper bounds for the Betti numbers of thistype of ideals. These take the form of simple formulas on the number of vertices, which arise fromthe enumeration of induced subgraphs of certain incomparability graphs associated to the edgesets of trees.
2007 ◽
Vol 75
(2)
◽
pp. 211-220
◽
Keyword(s):
2009 ◽
Vol 44
(9)
◽
pp. 1311-1325
◽
Keyword(s):
2017 ◽
Vol 16
(01)
◽
pp. 1750018
◽
2009 ◽
Vol 20
(5-6)
◽
pp. 481-495
◽
2019 ◽
Vol 18
(06)
◽
pp. 1950118