The multiplicity problem for indecomposable decompositions of modules over a finite-dimensional algebra. Algorithms and a computer algebra approach

DOI10.4064/cm107-2-4zbMath1149.16017OpenAlexW2015142758MaRDI QIDQ3414752

Piotr Dowbor, Andrzej Mróz

Publication date: 10 January 2007

Published in: Colloquium Mathematicum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4064/cm107-2-4

zbMATH Keywords

algorithmshereditary algebrasrepresentationsdecompositionsindecomposable modulesmultiplicity vectorsstring algebras of finite representation type

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Representation type (finite, tame, wild, etc.) of associative algebras (16G60) Auslander-Reiten sequences (almost split sequences) and Auslander-Reiten quivers (16G70) Representations of quivers and partially ordered sets (16G20) Computational aspects of associative rings (general theory) (16Z05)

Related Items (5)

On the Multiplicity Problem and the Isomorphism Problem for the Four Subspace Algebra ⋮ On interval decomposability of \(2\)D persistence modules ⋮ Decomposition theory of modules: the case of Kronecker algebra ⋮ On the normal forms of modules with respect to parametrizing bimodules. ⋮ On a separation of orbits in the module variety for string special biserial algebras.

This page was built for publication: The multiplicity problem for indecomposable decompositions of modules over a finite-dimensional algebra. Algorithms and a computer algebra approach