Minimal cellular resolutions of powers of graphs
Abstract
Let G be a connected graph and let I(G) denote its edge ideal. We classify when I(G)n, for n 1, admits a minimal Lyubeznik resolution. We also give a characterization for when I(G)n is bridge-friendly, which, in turn, implies that I(G)n has a minimal Barile-Macchia cellular resolution.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.