A rooted tree module over a zero-relation algebra is indecomposable (char K not 2) exactly when the defining tree has no nontrivial idempotent self-map, giving checkable splitting and construction algorithms.
Generalised tree modules: Hom-sets and indecomposability
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
For a zero-relation algebra over a field $\mathcal K$, Crawley-Boevey introduced the concept of a tree module and provided a combinatorial description of a basis for the space of homomorphisms between two tree modules--the basis elements are called graph maps. The indecomposability of tree modules is essentially due to Gabriel. We relax a condition in the definition of a tree module to define generalised tree modules and when $\mathrm{char}(\mathcal K)\neq2$, under a certain condition, provide a combinatorial description of a finite generating set for the space of homomorphisms between two such modules--we call the generators generalised graph maps. As an application, we provide a sufficient condition for the (in)decomposability of certain generalised tree modules. We also show that all indecomposable modules over a Dynkin quiver of type $\mathbf D$ are isomorphic to generalised tree modules--this result also follows from a theorem of Ringel which states that all exceptional modules over the path algebra $\mathcal KQ$ of a finite quiver $Q$ are generalised tree modules.
fields
math.RT 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Rooted tree modules
A rooted tree module over a zero-relation algebra is indecomposable (char K not 2) exactly when the defining tree has no nontrivial idempotent self-map, giving checkable splitting and construction algorithms.