2000 character limit reached
Path ideals of rooted trees and their graded Betti numbers
Published 28 Aug 2010 in math.AC and math.CO | (1008.4829v2)
Abstract: Let $\Gamma$ be a rooted tree and let $t$ be a positive integer. We study algebraic invariants and properties of the path ideal generated by monomial corresponding to paths of length $(t-1)$ in $\Gamma$. In particular, we give a recursive formula to compute the graded Betti numbers, a general bound for the regularity, an explicit computation of the linear strand, and we characterize when this path ideal has a linear resolution.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.