A decoration by ordinary and rooted cycles on ordered set partitions yields a cut-factorization theorem that computes the full bigraded S_n-homology of the resulting ribbon bar complexes.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Cycle-Decorated Ribbon Bar Complexes: Cut Factorization and Equivariant Homology
A decoration by ordinary and rooted cycles on ordered set partitions yields a cut-factorization theorem that computes the full bigraded S_n-homology of the resulting ribbon bar complexes.