Representations of equipped graphs: Auslander-Reiten theory
From MaRDI portal
Publication:4557417
Abstract: Representations of equipped graphs were introduced by Gelfand and Ponomarev; they are similar to representation of quivers, but one does not need to choose an orientation of the graph. In a previous article we have shown that, as in Kac's Theorem for quivers, the dimension vectors of indecomposable representations are exactly the positive roots for the graph. In this article we begin by surveying that work, and then we go on to discuss Auslander-Reiten theory for equipped graphs, and give examples of Auslander-Reiten quivers.
Recommendations
Cited in
(5)- The application of representation theory in directed strongly regular graphs
- scientific article; zbMATH DE number 16154 (Why is no real title available?)
- scientific article; zbMATH DE number 67199 (Why is no real title available?)
- On representations of graphs of type A
- Kac's theorem for equipped graphs and for maximal rank representations.
This page was built for publication: Representations of equipped graphs: Auslander-Reiten theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4557417)