Scarf complexes of connected and path ideals
Trung Chau, Richie Sheng, Tim Tribone, Deborah Wooton

TL;DR
This paper classifies graphs whose $t$-connected and $t$-path ideals are minimally resolved by their Scarf complexes, extending known results for edge ideals to specific higher-order ideals.
Contribution
It provides a classification of graphs with minimal resolutions via Scarf complexes for $t$-connected ideals and $t$-path ideals at $t=4$, generalizing previous work.
Findings
Classified graphs with $t$-connected ideals minimally resolved by Scarf complexes.
Classified graphs with 4-path ideals minimally resolved by Scarf complexes.
Abstract
The -connected ideal of a graph is generated by all connected induced subgraphs of with vertices. When , this coincides with the usual edge ideal of the graph. Following the work of Faridi et al., we give a classification of the graphs whose -connected ideals are minimally resolved by their Scarf complex. We also consider the -path ideal of a graph which is the ideal generated by all paths of length in . In this case, we are able to give a classification of the same type for paths of length .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCommutative Algebra and Its Applications · Rings, Modules, and Algebras · Polynomial and algebraic computation
