Multi-graded Betti numbers of path ideals of trees

Abstract

A path ideal of a tree is an ideal whose minimal generating set corresponds to paths of a specified length in a tree. We provide a description of a collection of induced subtrees whose vertex sets correspond to the multi-graded Betti numbers on the linear strand in the corresponding minimal free resolution of the path ideal. For two classes of path ideals, we give an explicit description of a collection of induced subforests whose vertex sets correspond to the multi-graded Betti numbers in the corresponding minimal free resolutions. Lastly, in both classes of path ideals considered, the graded Betti numbers are explicitly computed for [Formula: see text]-ary trees.