Rooted tree modules

TL;DR

This paper introduces rooted tree modules over certain algebras, providing combinatorial criteria for indecomposability and methods for their decomposition and recursive construction.

Contribution

It offers a combinatorial characterization of indecomposability and iterative methods for decomposing and constructing rooted tree modules over zero-relation algebras.

Findings

Characterization of indecomposability via quiver morphisms

Iterative method for decomposing RTMs

Recursive construction of indecomposable RTMs

Abstract

A rooted tree module (RTM) $M:=M(T,F)$ over a zero-relation algebra $\Lambda:=\mathcal KQ/\langle\rho\rangle$ over a field $\mathcal K$ is given by the data of a quiver morphism $F:T\to Q$ from a rooted tree $T$ (either with a source or a sink) taking paths in $T$ to paths in $Q$ not lying in $\langle\rho\rangle$. When $\mathrm{char}(\mathcal K)\neq2$, we provide a checkable combinatorial characterization of the indecomposability of the RTM $M$ in terms of non-existence of idempotent quiver morphisms $\iota:T\to T$ satisfying $F\circ\iota=F$ and $\iota\neq 1_T$. Further, we provide an iterative method to decompose an RTM into indecomposable RTMs as well as a method to recursively construct indecomposable RTMs.