CONSTRUCTING FULL BLOCK TRIANGULAR REPRESENTATIONS OF ALGEBRAS

Abstract

Every finite dimensional representation of an algebra is equivalent to a finite direct sum of indecomposable representations. Hence, the classification of indecomposable representations of algebras is a relevant (and usually complicated) task. In this note we study the existence of full block triangular representations, an interesting example of indecomposable representations, from a computational perspective. We describe an algorithm for determining whether or not an associative finitely presented k-algebra R has a full block triangular representation over [Formula: see text].