An algorithm for finding all preprojective components of the Auslander-Reiten quiver

DOI10.1090/S0025-5718-01-01404-1zbMath1015.16012OpenAlexW1976129122MaRDI QIDQ2781222

Klara Kögerler, Peter Dräxler

Publication date: 19 March 2002

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0025-5718-01-01404-1

zbMATH Keywords

algorithmsfinite dimensional algebraspath algebrasAuslander-Reiten quiverspreprojective componentsinitial subquivers

Mathematics Subject Classification ID

Auslander-Reiten sequences (almost split sequences) and Auslander-Reiten quivers (16G70) Paths and cycles (05C38) Algebraic combinatorics (05E99) Representations of quivers and partially ordered sets (16G20)

Cites Work

• Unnamed Item
• Unnamed Item
• Directing projective modules
• Tame algebras and integral quadratic forms
• A criterion for finite representation type
• Representation-finite algebras and multiplicative bases
• Covering spaces in representation-theory
• On the existence of postprojective components in the Auslander-Reiten quiver of an algebra
• Constructing the preprojective components of an algebra
• Unzerlegbare Darstellungen. I. (Indecomposable representations. I)
• Composition Factors for Indecomposable Modules
• Auslander-Reiten Quivers for Certain Algebras of Finite Representation Type
• Indecomposable representations of graphs and algebras
• Representation theory of artin algebras iii almost split sequences
• The Canonical Decomposition of the Poset of a Hammock

This page was built for publication: An algorithm for finding all preprojective components of the Auslander-Reiten quiver