Abstract
We provide a combinatorial algorithm for constructing the stable Auslander–Reiten component containing a given indecomposable module of a symmetric special biserial algebra using only information from its underlying Brauer graph. We also show that the structure of the Auslander–Reiten quiver is closely related to the distinct Green walks of the Brauer graph and detail the relationship between the precise shape of the stable Auslander–Reiten components for domestic Brauer graph algebras and their underlying graph. Furthermore, we show that the specific component containing a given simple or indecomposable projective module for any Brauer graph algebra is determined by the edge in the Brauer graph associated to the module.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.