For ghost-free pairs of generalised tree modules, homomorphisms are spanned by combinatorially defined generalised graph maps, yielding a sufficient condition for indecomposability.
Enumeration of mixed graphs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.RT 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Generalised tree modules: Hom-sets and indecomposability
For ghost-free pairs of generalised tree modules, homomorphisms are spanned by combinatorially defined generalised graph maps, yielding a sufficient condition for indecomposability.