Pruning preserves dg-algebra structures on minimal free resolutions of squarefree monomial ideals, enabling complete classification of dg-resolvable trees and cycles by longest path length.
[Gem76] Demissu Gemeda
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.AC 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
DG-Sensitive Pruning & a Complete Classification of DG Trees and Cycles
Pruning preserves dg-algebra structures on minimal free resolutions of squarefree monomial ideals, enabling complete classification of dg-resolvable trees and cycles by longest path length.