DG-sensitive pruning & a complete classification of DG trees and cycles
Journal of Algebraic Combinatorics · 2026-05 · 63 (3)
DOI: 10.1007/s10801-026-01529-4 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Algebraic Combinatorics, online erschienen am 05.05.2026. Verfasst von Hugh Geller und 2 weiteren Autor:innen. Die Arbeit nennt 27 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Given a squarefree monomial ideal I of a polynomial ring Q , we show that if the minimal free resolution $$\mathbb {F}$$ F of Q / I admits the structure of a differential graded (dg) algebra, then so does any “pruning” of $$\mathbb {F}$$ F . In the language of combinatorics, this says that if $$Q/\mathcal {F}(\Delta )$$ Q / F ( Δ ) , the quotient of the ambient polynomial ring by the facet ideal $$\mathcal {F}(\Delta )$$ F ( Δ ) of a simplicial complex $$\Delta $$ Δ , is minimally resolved by a dg algebra, then so is the quotient by the facet ideal of each facet-induced subcomplex of $$\Delta $$ Δ (over the smaller polynomial ring). Along with techniques from discrete Morse theory and homological algebra, this allows us to give complete classifications of the trees and cycles G with Q / I ( G ) minimally resolved by a dg algebra in terms of the length of the longest path in G , where I ( G ) is the edge ideal of G .
Zitieren
APA
Geller, H., Martin, D., & Potts-Rubin, H. (2026). DG-sensitive pruning & a complete classification of DG trees and cycles. Journal of Algebraic Combinatorics, 63(3). https://doi.org/10.1007/s10801-026-01529-4
Vancouver
Geller H, Martin D, Potts-Rubin H. DG-sensitive pruning & a complete classification of DG trees and cycles. Journal of Algebraic Combinatorics. 2026;63(3). doi:10.1007/s10801-026-01529-4
BibTeX
@article{Geller2026,
author = {Geller, Hugh and Martin, Desiree and Potts-Rubin, Henry},
title = {DG-sensitive pruning & a complete classification of DG trees and cycles},
journal = {Journal of Algebraic Combinatorics},
year = {2026},
volume = {63},
number = {3},
doi = {10.1007/s10801-026-01529-4}
}
EUVIMED