For ghost-free pairs of generalised tree modules, homomorphisms are spanned by combinatorially defined generalised graph maps, yielding a sufficient condition for indecomposability.
Characterisation of band bricks over certain string algebras and a variant of perfectly clustering words
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Generalising a recent work of Dequ\^ene et al. on the connection between perfectly clustering words and band bricks over a particular family of gentle algebras, we characterise band bricks over string algebras whose underlying quiver is acyclic in terms of weakly perfectly clustering pairs of words -- a variant of perfectly clustering words. As a consequence, we characterise band semibricks over all such algebras. Furthermore, the combination of our result and a result of Mousavand and Paquette provides an algorithm to determine whether such a string algebra is brick-infinite.
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.