Abstract
Let R = k[x1,…, xn], where k is a field. The path ideal (of length t) of a directed graph G is the monomial ideal, denoted by It(G), whose generators correspond to the directed paths of length t in G. We determine all the graded Betti numbers of the path ideal of a directed rooted tree with respect to some graphical terms.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
